Sciweavers

121 search results - page 1 / 25
» Elimination of Negation in a Logical Framework
Sort
View
LPAR
2005
Springer
13 years 10 months ago
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti G...
LOPSTR
2005
Springer
13 years 10 months ago
An Algorithm for Local Variable Elimination in Normal Logic Programs
A variable is local if it occurs in a clause body but not in its head. Local variables appear naturally in practical logic programming, but they complicate several aspects such as ...
Javier Álvez, Paqui Lucio
JLP
2000
134views more  JLP 2000»
13 years 4 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
LOPSTR
2009
Springer
13 years 11 months ago
Coinductive Logic Programming with Negation
Answer Set Programming (ASP) is a powerful paradigm of logic programming for non-monotonic reasoning. However, the restriction of “grounded range-restricted function-free normal ...
Richard Min, Gopal Gupta