default search action
John S. Schlipf
Person information
- affiliation: University of Cincinnati, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j17]Krishnendu Ghosh, John S. Schlipf:
Formal modeling of a system of chemical reactions under uncertainty. J. Bioinform. Comput. Biol. 12(5) (2014)
2000 – 2009
- 2008
- [c11]John S. Schlipf, Marc Denecker:
Complexity of First Order ID-Logic. ISAIM 2008 - 2007
- [e1]Chitta Baral, Gerhard Brewka, John S. Schlipf:
Logic Programming and Nonmonotonic Reasoning, 9th International Conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007, Proceedings. Lecture Notes in Computer Science 4483, Springer 2007, ISBN 978-3-540-72199-4 [contents] - 2006
- [b1]Gary Haggard, John S. Schlipf, Sue Whitesides:
Discrete mathematics for computer science. Thomson Brooks/Cole 2006, ISBN 978-0-534-49501-5, pp. I-XXXIII, 1-600 - [j16]Sean A. Weaver, John V. Franco, John S. Schlipf:
Extending Existential Quantification in Conjunctions of BDDs. J. Satisf. Boolean Model. Comput. 1(2): 89-110 (2006) - 2004
- [j15]John V. Franco, Michal Kouril, John S. Schlipf, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet:
Function-Complete Lookahead in Support of Efficient SAT Search Heuristics. J. Univers. Comput. Sci. 10(12): 1655-1695 (2004) - [c10]Jeffrey Ward, John S. Schlipf:
Answer Set Programming with Clause Learning. LPNMR 2004: 302-313 - 2003
- [c9]John V. Franco, Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet:
SBSAT: a State-Based, BDD-Based Satisfiability Solver. SAT 2003: 398-410
1990 – 1999
- 1999
- [j14]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. Ann. Math. Artif. Intell. 25(3-4): 275-309 (1999) - [j13]John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan:
An Algorithm for the Class of Pure Implicational Formulas. Discret. Appl. Math. 96-97: 89-106 (1999) - 1997
- [c8]J. Seitzer, John S. Schlipf:
Affordable Classes of Normal Logic Programs. LPNMR 1997: 92-111 - 1995
- [j12]Howard A. Blair, V. Wiktor Marek, John S. Schlipf:
The Expressiveness of Locally Stratified Programs. Ann. Math. Artif. Intell. 15(2): 209-229 (1995) - [j11]John S. Schlipf:
Complexity and Undecidability Results for Logic Programming. Ann. Math. Artif. Intell. 15(3-4): 257-288 (1995) - [j10]Kenneth A. Berman, John V. Franco, John S. Schlipf:
Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time. Discret. Appl. Math. 60(1-3): 77-91 (1995) - [j9]John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan:
On Finding Solutions for Extended Horn Formulas. Inf. Process. Lett. 54(3): 133-137 (1995) - [j8]John S. Schlipf:
The Expressive Powers of the Logic Programming Semantics. J. Comput. Syst. Sci. 51(1): 64-86 (1995) - [c7]Kenneth A. Berman, John S. Schlipf, John V. Franco:
Computing Well-founded Semantics Faster. LPNMR 1995: 113-126 - 1993
- [j7]Allen Van Gelder, John S. Schlipf:
Commonsense Axiomatizations for Logic Programs. J. Log. Program. 17(2/3&4): 161-195 (1993) - 1992
- [j6]John S. Schlipf:
Formalizing a Logic for Logic Programming. Ann. Math. Artif. Intell. 5(2-4): 279-302 (1992) - [c6]John S. Schlipf:
A Survey of Complexity and Undecidability Results in Logic Programming. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 143-164 - 1991
- [j5]Allen Van Gelder, Kenneth A. Ross, John S. Schlipf:
The Well-Founded Semantics for General Logic Programs. J. ACM 38(3): 620-650 (1991) - [c5]John S. Schlipf:
Representing Epistemic Intervals in Logic Programs. LPNMR 1991: 133-147 - 1990
- [c4]John S. Schlipf:
The Expressive Powers of the Logic Programming Semantics. PODS 1990: 196-204
1980 – 1989
- 1988
- [c3]John S. Schlipf:
When is Closed World Reasoning Tractable? ISMIS 1988: 485-494 - [c2]Allen Van Gelder, Kenneth A. Ross, John S. Schlipf:
Unfounded Sets and Well-Founded Semantics for General Logic Programs. PODS 1988: 221-230 - 1987
- [j4]John S. Schlipf:
Decidability and definability with circumscription. Ann. Pure Appl. Log. 35: 173-191 (1987) - 1986
- [c1]John S. Schlipf:
How Uncomputable is General Circumscription? (Extended Abstract). LICS 1986: 92-95
1970 – 1979
- 1978
- [j3]John S. Schlipf:
Toward Model Theory Through Recursive Saturation. J. Symb. Log. 43(2): 183-206 (1978) - 1977
- [j2]John S. Schlipf:
Ordinal Spectra of First-Order Theories. J. Symb. Log. 42(4): 492-505 (1977) - 1976
- [j1]Jon Barwise, John S. Schlipf:
An Introduction to Recursively Saturated and Resplendent Models. J. Symb. Log. 41(2): 531-536 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint