( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Representing first-order causal theories by logic programs.

, , , , и . Theory Pract. Log. Program., 12 (3): 383-412 (2012)

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.

Luis Ferraris

Christine Ferraris

Davide Ferraris

Giordano Paolo

Paolo Molteni

 

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

Logic programs with propositional connectives and aggregates. CoRR, (2008)Answer Sets for Propositional Theories.. LPNMR, том 3662 из Lecture Notes in Computer Science, стр. 119-131. Springer, (2005)Almost Definite Causal Theories., , и . LPNMR, том 2923 из Lecture Notes in Computer Science, стр. 74-86. Springer, (2004)A generalization of the Lin-Zhao theorem., , и . Ann. Math. Artif. Intell., 47 (1-2): 79-101 (2006)Mathematical Foundations of Answer Set Programming., и . We Will Show Them! (1), стр. 615-664. College Publications, (2005)Weight Constraints as Nested Expressions, и . CoRR, (2003)Propositional theories are strongly equivalent to logic programs., и . Theory Pract. Log. Program., 7 (6): 745-759 (2007)Evaluation of the magnetization direction effects on ferrite PM brushless fractional machines., , , и . IECON, стр. 6194-6199. IEEE, (2012)On Modular Translations and Strong Equivalence.. LPNMR, том 3662 из Lecture Notes in Computer Science, стр. 79-91. Springer, (2005)Logic programs with propositional connectives and aggregates.. ACM Trans. Comput. Log., 12 (4): 25:1-25:40 (2011)