Sciweavers

725 search results - page 6 / 145
» Complexity of Computing with Extended Propositional Logic Pr...
Sort
View
ECSQARU
2007
Springer
14 years 1 months ago
Syntactic Propositional Belief Bases Fusion with Removed Sets
Abstract. The problem of merging multiple sources information is central in several domains of computer science. In knowledge representation for artificial intelligence, several a...
Julien Hué, Odile Papini, Eric Würbel
ASP
2003
Springer
14 years 19 days ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
ECCC
2007
90views more  ECCC 2007»
13 years 7 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
LPNMR
2005
Springer
14 years 27 days ago
Answer Sets for Propositional Theories
Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case...
Paolo Ferraris
CORR
2011
Springer
180views Education» more  CORR 2011»
13 years 2 months ago
Representing First-Order Causal Theories by Logic Programs
Nonmonotonic causal logic, introduced by Norman McCain and Hudson Turner, became a basis for the semantics of several expressive action languages. McCain’s embedding of definit...
Paolo Ferraris, Joohyung Lee, Yuliya Lierler, Vlad...