John S. Schlipf

30 papers A* 3A 1B 5C 1Misc 1Journal 17Unranked 1

Year	Rank	Type	Title / Venue / Authors
2014	J	`jnl`	Formal modeling of a system of chemical reactions under uncertainty. J. Bioinform. Comput. Biol. Krishnendu Ghosh, John S. Schlipf
2008	Misc	`conf`	Complexity of First Order ID-Logic. ISAIM John S. Schlipf, Marc Denecker
2007	B	`ed.`	Logic Programming and Nonmonotonic Reasoning, 9th International Conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007, Proceedings LPNMR Chitta Baral, Gerhard Brewka, John S. Schlipf
2006	—	`book`	Discrete mathematics for computer science. Gary Haggard, John S. Schlipf, Sue Whitesides
2006	J	`jnl`	Extending Existential Quantification in Conjunctions of BDDs. J. Satisf. Boolean Model. Comput. Sean A. Weaver, John V. Franco, John S. Schlipf
2004	B	`conf`	Answer Set Programming with Clause Learning. LPNMR Jeffrey Ward, John S. Schlipf
2004	J	`jnl`	Function-Complete Lookahead in Support of Efficient SAT Search Heuristics. J. Univers. Comput. Sci. John V. Franco, Michal Kouril, John S. Schlipf, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet
2003	A	`conf`	SBSAT: a State-Based, BDD-Based Satisfiability Solver. SAT John V. Franco, Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet
1999	J	`jnl`	An Algorithm for the Class of Pure Implicational Formulas. Discret. Appl. Math. John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan
1999	J	`jnl`	An Empirical Study of the 4-valued Kripke-Kleene and 4-valued Well-Founded Semantics in Random Propositional Logic Programs. Ann. Math. Artif. Intell. Chris Giannella, John S. Schlipf
1997	B	`conf`	Affordable Classes of Normal Logic Programs. LPNMR J. Seitzer, John S. Schlipf
1995	J	`jnl`	Complexity and Undecidability Results for Logic Programming. Ann. Math. Artif. Intell. John S. Schlipf
1995	B	`conf`	Computing Well-founded Semantics Faster. LPNMR Kenneth A. Berman, John S. Schlipf, John V. Franco
1995	J	`jnl`	On Finding Solutions for Extended Horn Formulas. Inf. Process. Lett. John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan
1995	J	`jnl`	The Expressive Powers of the Logic Programming Semantics. J. Comput. Syst. Sci. John S. Schlipf
1995	J	`jnl`	The Expressiveness of Locally Stratified Programs. Ann. Math. Artif. Intell. Howard A. Blair, V. Wiktor Marek, John S. Schlipf
1995	J	`jnl`	Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time. Discret. Appl. Math. Kenneth A. Berman, John V. Franco, John S. Schlipf
1993	J	`jnl`	Commonsense Axiomatizations for Logic Programs. J. Log. Program. Allen Van Gelder, John S. Schlipf
1992	—	`conf`	A Survey of Complexity and Undecidability Results in Logic Programming. Structural Complexity and Recursion-theoretic methods in Logic-Programming John S. Schlipf
1992	J	`jnl`	Formalizing a Logic for Logic Programming. Ann. Math. Artif. Intell. John S. Schlipf
1991	B	`conf`	Representing Epistemic Intervals in Logic Programs. LPNMR John S. Schlipf
1991	J	`jnl`	The Well-Founded Semantics for General Logic Programs. J. ACM Allen Van Gelder, Kenneth A. Ross, John S. Schlipf
1990	A*	`conf`	The Expressive Powers of the Logic Programming Semantics. PODS John S. Schlipf
1988	A*	`conf`	Unfounded Sets and Well-Founded Semantics for General Logic Programs. PODS Allen Van Gelder, Kenneth A. Ross, John S. Schlipf
1988	C	`conf`	When is Closed World Reasoning Tractable? ISMIS John S. Schlipf
1987	J	`jnl`	Decidability and definability with circumscription. Ann. Pure Appl. Log. John S. Schlipf
1986	A*	`conf`	How Uncomputable is General Circumscription? (Extended Abstract) LICS John S. Schlipf
1978	J	`jnl`	Toward Model Theory Through Recursive Saturation. J. Symb. Log. John S. Schlipf
1977	J	`jnl`	Ordinal Spectra of First-Order Theories. J. Symb. Log. John S. Schlipf
1976	J	`jnl`	An Introduction to Recursively Saturated and Resplendent Models. J. Symb. Log. Jon Barwise, John S. Schlipf