( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Complexity and Undecidability Results for Logic Programming.

. Ann. Math. Artif. Intell., 15 (3-4): 257-288 (1995)

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.

Josef Schlipf

Josef Schlipf

Irene Schlipf

Irene Schlipf

Josef Schlipf

 

Другие публикации лиц с тем же именем

Unfounded Sets and Well-Founded Semantics for General Logic Programs., , и . PODS, стр. 221-230. ACM, (1988)How Uncomputable is General Circumscription? (Extended Abstract). LICS, стр. 92-95. IEEE Computer Society, (1986)Complexity of First Order ID-Logic., и . ISAIM, (2008)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)When is Closed World Reasoning Tractable?. ISMIS, стр. 485-494. North-Holland/Elsevier, (1988)Computing Well-founded Semantics Faster., , и . LPNMR, том 928 из Lecture Notes in Computer Science, стр. 113-126. Springer, (1995)An Introduction to Recursively Saturated and Resplendent Models., и . J. Symb. Log., 41 (2): 531-536 (1976)The Well-Founded Semantics for General Logic Programs, , и . Journal of the ACM, 38 (3): 620--650 (1991)Representing Epistemic Intervals in Logic Programs.. LPNMR, стр. 133-147. The MIT Press, (1991)