146 search results - page 8 / 30 » Modelling and solving temporal reasoning as propositional sa... |
AI
2005
Springer
14 years 9 months ago
2005
Springer
Cooperation logics have recently begun to attract attention within the multi-agent systems community. Using a cooperation logic, it is possible to represent and reason about the s...
93
Voted
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
SAC
2004
ACM
15 years 3 months ago
2004
ACM
This paper aims to describe the relationship between propositional planning systems and the process of means-end reasoning used by BDI agents. To show such relationship, we defin...
74
Voted
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
We motivate and study a generic relaxation of correctness of reactive and concurrent systems with respect to a temporal specification. We define a system to be fairly correct if...
CADE
2003
Springer
15 years 10 months ago
2003
Springer
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...