John S. Schlipf

Available identifiers

zbMath Open schlipf.john-stewartMaRDI QIDQ579239

List of research outcomes

Publication	Date of Publication	Type
Computing the well-founded semantics faster	2022-08-30	Paper
https://portal.mardi4nfdi.de/entity/Q3467152	2016-01-26	Paper
Theory and Applications of Satisfiability Testing	2009-07-24	Paper
https://portal.mardi4nfdi.de/entity/Q3507034	2008-06-18	Paper
Logic Programming and Nonmonotonic Reasoning	2007-11-07	Paper
An algorithm for the class of pure implicational formulas	2000-01-17	Paper
Formalizing a logic for logic programming	1997-05-13	Paper
Complexity and undecidability results for logic programming	1997-03-25	Paper
On finding solutions for extended Horn formulas	1997-02-28	Paper
The expressiveness of locally stratified programs	1997-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q4878771	1996-10-07	Paper
The expressive powers of the logic programming semantics	1995-10-25	Paper
Unique satisfiability of Horn sets can be solved in nearly linear time	1995-09-06	Paper
The well-founded semantics for general logic programs	1994-11-13	Paper
Commonsense axiomatizations for logic programs	1994-01-13	Paper
Decidability and definability with circumscription	1987-01-01	Paper
Generating subsets of order statistics with applications to trimmed means and means of trimmings	1986-01-01	Paper
Who's being swindled?: a case for enlightened naivete	1986-01-01	Paper
Recursively Saturated Models of Set Theory	1980-01-01	Paper
Toward model theory through recursive saturation	1978-01-01	Paper
Ordinal spectra of first-order theories	1978-01-01	Paper
A Generalized Kleene-Moschovakis Theorem	1978-01-01	Paper
A guide to the identification of admissible sets above structures	1977-01-01	Paper
An introduction to recursively saturated and resplendent models	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4110995	1975-01-01	Paper

Research outcomes over time

This page was built for person: John S. Schlipf