( en | de | ru )

 

Disambiguation of "Schlipf, John S."

Author of the publication

copydeleteadd this publication to your clipboard
Answer Set Programming with Clause Learning.

, and . LPNMR, volume 2923 of Lecture Notes in Computer Science, page 302-313. Springer, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Josef Schlipf

Josef Schlipf

Irene Schlipf

Irene Schlipf

Josef Schlipf

 

Other publications of authors with the same name

How Uncomputable is General Circumscription? (Extended Abstract). LICS, page 92-95. IEEE Computer Society, (1986)Unfounded Sets and Well-Founded Semantics for General Logic Programs., , and . PODS, page 221-230. ACM, (1988)Complexity of First Order ID-Logic., and . ISAIM, (2008)When is Closed World Reasoning Tractable?. ISMIS, page 485-494. North-Holland/Elsevier, (1988)Complexity and Undecidability Results for Logic Programming.. Ann. Math. Artif. Intell., 15 (3-4): 257-288 (1995)Formalizing a Logic for Logic Programming.. Ann. Math. Artif. Intell., 5 (2-4): 279-302 (1992)Affordable Classes of Normal Logic Programs., and . LPNMR, volume 1265 of Lecture Notes in Computer Science, page 92-111. Springer, (1997)The Well-Founded Semantics for General Logic Programs, , and . Journal of the ACM, 38 (3): 620--650 (1991)An Introduction to Recursively Saturated and Resplendent Models., and . J. Symb. Log., 41 (2): 531-536 (1976)Representing Epistemic Intervals in Logic Programs.. LPNMR, page 133-147. The MIT Press, (1991)