Sciweavers

181 search results - page 22 / 37
» On the Completeness of Propositional Hoare Logic
Sort
View
AI
2004
Springer
14 years 9 months ago
ASSAT: computing answer sets of a logic program by SAT solvers
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
Fangzhen Lin, Yuting Zhao
JLP
2000
134views more  JLP 2000»
14 years 9 months ago
Abducing through negation as failure: stable models within the independent choice logic
The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics charact...
David Poole
AAAI
1990
14 years 10 months ago
Exploiting Locality in a TMS
This paper presents a new approach for exploiting Truth Maintenance Systems(TMSs) which makes them simpler to use without necessarily incurring a substantial performance penalty. ...
Johan de Kleer
ANLP
2000
123views more  ANLP 2000»
14 years 11 months ago
Generating Text with a Theorem Prover
The process of documenting designs is tedious and often error-prone. We discuss a system that automatically generates documentation for the single step transition behavior of Stat...
Ivan I. Garibay
JLP
2010
85views more  JLP 2010»
14 years 4 months ago
Synchronous Kleene algebra
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...
Cristian Prisacariu