The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

John S. Schlipf: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Allen Van Gelder, Kenneth A. Ross, John S. Schlipf
    The Well-Founded Semantics for General Logic Programs. [Citation Graph (45, 0)][DBLP]
    J. ACM, 1991, v:38, n:3, pp:620-650 [Journal]
  2. Allen Van Gelder, Kenneth A. Ross, John S. Schlipf
    Unfounded Sets and Well-Founded Semantics for General Logic Programs. [Citation Graph (24, 12)][DBLP]
    PODS, 1988, pp:221-230 [Conf]
  3. John S. Schlipf
    The Expressive Powers of the Logic Programming Semantics. [Citation Graph (4, 17)][DBLP]
    PODS, 1990, pp:196-204 [Conf]
  4. John S. Schlipf
    The Expressive Powers of the Logic Programming Semantics. [Citation Graph (4, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:1, pp:64-86 [Journal]
  5. Howard A. Blair, V. Wiktor Marek, John S. Schlipf
    The Expressiveness of Locally Stratified Programs. [Citation Graph (1, 0)][DBLP]
    Ann. Math. Artif. Intell., 1995, v:15, n:2, pp:209-229 [Journal]
  6. John S. Schlipf
    Complexity and Undecidability Results for Logic Programming. [Citation Graph (1, 0)][DBLP]
    Ann. Math. Artif. Intell., 1995, v:15, n:3-4, pp:257-288 [Journal]
  7. John S. Schlipf
    A Survey of Complexity and Undecidability Results in Logic Programming. [Citation Graph (0, 0)][DBLP]
    Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992, pp:143-164 [Conf]
  8. John S. Schlipf
    When is Closed World Reasoning Tractable? [Citation Graph (0, 0)][DBLP]
    ISMIS, 1988, pp:485-494 [Conf]
  9. John S. Schlipf
    How Uncomputable is General Circumscription? (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1986, pp:92-95 [Conf]
  10. Kenneth A. Berman, John S. Schlipf, John V. Franco
    Computing Well-founded Semantics Faster. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1995, pp:113-126 [Conf]
  11. John S. Schlipf
    Representing Epistemic Intervals in Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1991, pp:133-147 [Conf]
  12. J. Seitzer, John S. Schlipf
    Affordable Classes of Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1997, pp:92-111 [Conf]
  13. Jeffrey Ward, John S. Schlipf
    Answer Set Programming with Clause Learning. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2004, pp:302-313 [Conf]
  14. John V. Franco, Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean Weaver, Michael Dransfield, W. Mark Vanfleet
    SBSAT: a State-Based, BDD-Based Satisfiability Solver. [Citation Graph (0, 0)][DBLP]
    SAT, 2003, pp:398-410 [Conf]
  15. Chris Giannella, John S. Schlipf
    An Empirical Study of the 4-valued Kripke-Kleene and 4-valued Well-Founded Semantics in Random Propositional Logic Programs. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1999, v:25, n:3-4, pp:275-309 [Journal]
  16. John S. Schlipf
    Formalizing a Logic for Logic Programming. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1992, v:5, n:2-4, pp:279-302 [Journal]
  17. Kenneth A. Berman, John V. Franco, John S. Schlipf
    Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:77-91 [Journal]
  18. John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan
    An Algorithm for the Class of Pure Implicational Formulas. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:96, n:, pp:89-106 [Journal]
  19. John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan
    On Finding Solutions for Extended Horn Formulas. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:3, pp:133-137 [Journal]
  20. Allen Van Gelder, John S. Schlipf
    Commonsense Axiomatizations for Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1993, v:17, n:2/3&4, pp:161-195 [Journal]
  21. Jon Barwise, John S. Schlipf
    An Introduction to Recursively Saturated and Resplendent Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:2, pp:531-536 [Journal]
  22. John S. Schlipf
    Ordinal Spectra of First-Order Theories. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1977, v:42, n:4, pp:492-505 [Journal]
  23. John S. Schlipf
    Toward Model Theory Through Recursive Saturation. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1978, v:43, n:2, pp:183-206 [Journal]
  24. John V. Franco, Michal Kouril, John S. Schlipf, Sean Weaver, Michael Dransfield, W. Mark Vanfleet
    Function-Complete Lookahead in Support of Efficient SAT Search Heuristics. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2004, v:10, n:12, pp:1655-1695 [Journal]

Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002