725 search results - page 44 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
222
Voted
ICLP
2009
Springer
16 years 3 months ago
2009
Springer
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
132
Voted
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
128
Voted
ISSTA
2010
ACM
15 years 4 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
104
click to vote
LICS
2008
IEEE
15 years 9 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
97
Voted
AI
2005
Springer
15 years 2 months ago
2005
Springer
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...