Sciweavers

74 search results - page 4 / 15
» On the Parameterized Complexity of Default Logic and Autoepi...
Sort
View
SAT
2010
Springer
178views Hardware» more  SAT 2010»
14 years 14 days ago
Proof Complexity of Propositional Default Logic
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and s...
Olaf Beyersdorff, Arne Meier, Sebastian Mülle...
FUIN
2002
74views more  FUIN 2002»
13 years 8 months ago
Complexity of the Unique Extension Problem in Default Logic
Xishun Zhao, Paolo Liberatore
AAAI
2008
13 years 11 months ago
Hyperequivalence of Logic Programs with Respect to Supported Models
Recent research in nonmonotonic logic programming has focused on program equivalence relevant for program optimization and modular programming. So far, most results concern the st...
Miroslaw Truszczynski, Stefan Woltran
BIRTHDAY
2010
Springer
13 years 6 months ago
A Logic for PTIME and a Parameterized Halting Problem
In [7] Nash, Remmel, and Vianu have raised the question whether a logic L, already introduced by Gurevich in 1988, captures polynomial time, and they give a reformulation of this ...
Yijia Chen, Jörg Flum
KR
2000
Springer
14 years 4 days ago
A Logic Based Language for Parametric Inheritance
Though overriding as a single and default mode of inheritance is adequate for most knowledge bases, a large class of applications naturally requires several inheritance modes and ...
Hasan M. Jamil