74 search results - page 12 / 15 » The Complexity of Reasoning for Fragments of Autoepistemic L... |
LICS
1998
IEEE
15 years 5 months ago
1998
IEEE
d abstract) T. Eiter G. Gottlob Y. Gurevich Institut fur Informatik Institut fur Informationssysteme EECS Department Universitat Gie en Technische Universitat Wien University of Mi...
AAAI
1998
15 years 2 months ago
1998
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
182
click to vote
POPL
2011
ACM
14 years 4 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
124
click to vote
ICLP
2007
Springer
15 years 5 months ago
2007
Springer
We present the CIFFWEB system, an innovative tool for the verification of web sites, relying upon abductive logic programming. The system allows the user to define rules that a web...
116
Voted
LICS
1994
IEEE
15 years 5 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...