John S. Schlipf

According to our database, John S. Schlipf authored at least 28 papers between 1976 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

Formal modeling of a system of chemical reactions under uncertainty.

Krishnendu Ghosh, John S. Schlipf

J. Bioinform. Comput. Biol., 2014

2008

Complexity of First Order ID-Logic.

John S. Schlipf, Marc Denecker

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

2006

Extending Existential Quantification in Conjunctions of BDDs.

Sean A. Weaver, John V. Franco, John S. Schlipf

J. Satisf. Boolean Model. Comput., 2006

Discrete mathematics for computer science.

Gary Haggard, John S. Schlipf, Sue Whitesides

Thomson Brooks/Cole, ISBN: 978-0-534-49501-5, 2006

2004

Function-Complete Lookahead in Support of Efficient SAT Search Heuristics.

John V. Franco, Michal Kouril, John S. Schlipf, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet

J. Univers. Comput. Sci., 2004

Answer Set Programming with Clause Learning.

Jeffrey Ward, John S. Schlipf

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

2003

SBSAT: a State-Based, BDD-Based Satisfiability Solver.

John V. Franco, Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

1999

An Algorithm for the Class of Pure Implicational Formulas.

John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan

Discret. Appl. Math., 1999

An Empirical Study of the 4-valued Kripke-Kleene and 4-valued Well-Founded Semantics in Random Propositional Logic Programs.

Chris Giannella, John S. Schlipf

Ann. Math. Artif. Intell., 1999

1997

Affordable Classes of Normal Logic Programs.

J. Seitzer, John S. Schlipf

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1997

1995

The Expressive Powers of the Logic Programming Semantics.

John S. Schlipf

J. Comput. Syst. Sci., 1995

On Finding Solutions for Extended Horn Formulas.

John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan

Inf. Process. Lett., 1995

Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time.

Kenneth A. Berman, John V. Franco, John S. Schlipf

Discret. Appl. Math., 1995

Complexity and Undecidability Results for Logic Programming.

John S. Schlipf

Ann. Math. Artif. Intell., 1995

The Expressiveness of Locally Stratified Programs.

Howard A. Blair, V. Wiktor Marek, John S. Schlipf

Ann. Math. Artif. Intell., 1995

Computing Well-founded Semantics Faster.

Kenneth A. Berman, John S. Schlipf, John V. Franco

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1995

1993

Commonsense Axiomatizations for Logic Programs.

Allen Van Gelder, John S. Schlipf

J. Log. Program., 1993

1992

Formalizing a Logic for Logic Programming.

John S. Schlipf

Ann. Math. Artif. Intell., 1992

A Survey of Complexity and Undecidability Results in Logic Programming.

John S. Schlipf

Proceedings of the Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992

1991

The Well-Founded Semantics for General Logic Programs.

Allen Van Gelder, Kenneth A. Ross, John S. Schlipf

J. ACM, 1991

Representing Epistemic Intervals in Logic Programs.

John S. Schlipf

Proceedings of the Logic Programming and Non-monotonic Reasoning, 1991

1988

Unfounded Sets and Well-Founded Semantics for General Logic Programs.

Allen Van Gelder, Kenneth A. Ross, John S. Schlipf

Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1988

When is Closed World Reasoning Tractable?

John S. Schlipf

Proceedings of the Methodologies for Intelligent Systems, 1988

1987

Decidability and definability with circumscription.

John S. Schlipf

Ann. Pure Appl. Log., 1987

1986

How Uncomputable is General Circumscription? (Extended Abstract)

John S. Schlipf

Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

1978

Toward Model Theory Through Recursive Saturation.

John S. Schlipf

J. Symb. Log., 1978

1977

Ordinal Spectra of First-Order Theories.

John S. Schlipf

J. Symb. Log., 1977

1976

An Introduction to Recursively Saturated and Resplendent Models.

Jon Barwise, John S. Schlipf

J. Symb. Log., 1976