From post

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.

 

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

The complexity of model checking for propositional default logics., и . Data Knowl. Eng., 55 (2): 189-202 (2005)Comparing Space Efficiency of Propositional Knowledge Representation Formalisms., , , и . KR, стр. 364-373. Morgan Kaufmann, (1996)The Complexity of Action Redundancy., , и . AI*IA, том 3673 из Lecture Notes in Computer Science, стр. 1-12. Springer, (2005)On the size of data structures used in symbolic model checking, и . CoRR, (2010)Space Efficiency of Propositional Knowledge Representation Formalisms, , , и . CoRR, (2011)Computing the Shapley Value in Allocation Problems: Approximations and Bounds, with an Application to the Italian VQR Research Assessment Program., , , , и . CoRR, (2017)The Size of a Revised Knowledge Base., , , и . Artif. Intell., 115 (1): 25-64 (1999)Nonmonotonic reasoning., , , , и . Artif. Intell. Rev., 4 (3): 163-210 (1990)Negation and Minimality in Non-Horn Databases.. PODS, стр. 147-157. ACM Press, (1993)Partial Solutions with Unique Completion., и . Reasoning, Action and Interaction in AI Theories and Systems, том 4155 из Lecture Notes in Computer Science, стр. 101-115. Springer, (2006)