John S. Schlipf - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2014

Formal modeling of a system of chemical reactions under uncertaintyKrishnendu Ghosh, John S. Schlipf. jbcb, 12(5), 2014. [doi]

2008

Complexity of First Order ID-LogicJohn S. Schlipf, Marc Denecker. isaim 2008: [doi]

2006

Discrete mathematics for computer scienceGary Haggard, John S. Schlipf, Sue Whitesides. Thomson Brooks/Cole, 2006.

Extending Existential Quantification in Conjunctions of BDDsSean Weaver, John V. Franco, John S. Schlipf. jsat, 1(2):89-110, 2006. [doi]

2004

Function-Complete Lookahead in Support of Efficient SAT Search HeuristicsJohn V. Franco, Michal Kouril, John S. Schlipf, Sean Weaver, Michael Dransfield, W. Mark Vanfleet. jucs, 10(12):1655-1695, 2004. [doi]

Answer Set Programming with Clause LearningJeffrey Ward, John S. Schlipf. lpnmr 2004: 302-313 [doi]

2003

SBSAT: a State-Based, BDD-Based Satisfiability SolverJohn V. Franco, Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean Weaver, Michael Dransfield, W. Mark Vanfleet. sat 2004: 398-410 [doi]

1999

An Algorithm for the Class of Pure Implicational FormulasJohn V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan. DAM, 96-97:89-106, 1999. [doi]

An Empirical Study of the 4-valued Kripke-Kleene and 4-valued Well-Founded Semantics in Random Propositional Logic ProgramsChris Giannella, John S. Schlipf. AMAI, 25(3-4):275-309, 1999.

1997

Affordable Classes of Normal Logic ProgramsJ. Seitzer, John S. Schlipf. lpnmr 1997: 92-111

1995

Computing Well-founded Semantics FasterKenneth A. Berman, John S. Schlipf, John V. Franco. lpnmr 1995: 113-126

Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear TimeKenneth A. Berman, John V. Franco, John S. Schlipf. DAM, 60(1-3):77-91, 1995. [doi]

The Expressiveness of Locally Stratified ProgramsHoward A. Blair, V. Wiktor Marek, John S. Schlipf. AMAI, 15(2):209-229, 1995.

Complexity and Undecidability Results for Logic ProgrammingJohn S. Schlipf. AMAI, 15(3-4):257-288, 1995.

On Finding Solutions for Extended Horn FormulasJohn S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan. ipl, 54(3):133-137, 1995. [doi]

The Expressive Powers of the Logic Programming SemanticsJohn S. Schlipf. jcss, 51(1):64-86, 1995.

1993

Commonsense Axiomatizations for Logic ProgramsAllen Van Gelder, John S. Schlipf. jlp, 17(2/3&4):161-195, 1993.

1992

Formalizing a Logic for Logic ProgrammingJohn S. Schlipf. AMAI, 5(2-4):279-302, 1992.

A Survey of Complexity and Undecidability Results in Logic ProgrammingJohn S. Schlipf. ICLP 1992: 143-164

1991

The Well-Founded Semantics for General Logic ProgramsAllen Van Gelder, Kenneth A. Ross, John S. Schlipf. JACM, 38(3):620-650, 1991. [doi]

Representing Epistemic Intervals in Logic ProgramsJohn S. Schlipf. lpnmr 1991: 133-147

1990

The Expressive Powers of the Logic Programming SemanticsJohn S. Schlipf. PODS 1990: 196-204 [doi]

1988

Unfounded Sets and Well-Founded Semantics for General Logic ProgramsAllen Van Gelder, Kenneth A. Ross, John S. Schlipf. PODS 1988: 221-230 [doi]

When is Closed World Reasoning Tractable?John S. Schlipf. ismis 1988: 485-494

1987

Decidability and definability with circumscriptionJohn S. Schlipf. APAL, 35:173-191, 1987. [doi]

1986

How Uncomputable is General Circumscription? (Extended Abstract)John S. Schlipf. lics 1986: 92-95

1978

Toward Model Theory Through Recursive SaturationJohn S. Schlipf. JSYML, 43(2):183-206, 1978.

1977

Ordinal Spectra of First-Order TheoriesJohn S. Schlipf. JSYML, 42(4):492-505, 1977.

1976

An Introduction to Recursively Saturated and Resplendent ModelsJon Barwise, John S. Schlipf. JSYML, 41(2):531-536, 1976.

Sign in or sign up to see more results.

runs on WebDSL