Author of the publication

Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming.

, , , , and . KR, page 377-387. AAAI Press, (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.

 

Other publications of authors with the same name

Belief revision within fragments of propositional logic., , , and . J. Comput. Syst. Sci., 80 (2): 427-449 (2014)A solver for QBFs in negation normal form., , and . Constraints, 14 (1): 38-79 (2009)A common view on strong, uniform, and other notions of equivalence in answer-set programming.. TPLP, 8 (2): 217-234 (2008)Complexity of super-coherence problems in ASP., , and . TPLP, 14 (3): 339-361 (2014)Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence., , and . AAAI, AAAI Press, (2013)Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough., , , and . KR, AAAI Press, (2010)Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results., , , , and . Answer Set Programming, (2001)A Solver for QBFs in Nonprenex Form., , and . ECAI, volume 141 of Frontiers in Artificial Intelligence and Applications, page 477-481. IOS Press, (2006)On rejected arguments and implicit conflicts: The hidden power of argumentation semantics., , , , , and . Artif. Intell., (2016)Modularity Aspects of Disjunctive Stable Models., , , and . J. Artif. Intell. Res., (2009)