Sciweavers

764 search results - page 20 / 153
» On the Expressibility of Stable Logic Programming
Sort
View
ASIAN
1999
Springer
99views Algorithms» more  ASIAN 1999»
14 years 11 days ago
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sa...
Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakr...
ECP
1997
Springer
130views Robotics» more  ECP 1997»
14 years 7 days ago
Encoding Planning Problems in Nonmonotonic Logic Programs
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
Yannis Dimopoulos, Bernhard Nebel, Jana Koehler
AAAI
2004
13 years 9 months ago
Logic Programs with Abstract Constraint Atoms
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
Victor W. Marek, Miroslaw Truszczynski
CP
2005
Springer
14 years 1 months ago
Eplex: Harnessing Mathematical Programming Solvers for Constraint Logic Programming
The eplex library of the ECLi PSe Constraint Logic Programming platform allows the integration of Mathematical Programming techniques with its native Constraint Logic Programming t...
Kish Shen, Joachim Schimpf
FMCAD
2008
Springer
13 years 9 months ago
Scaling Up the Formal Verification of Lustre Programs with SMT-Based Techniques
We present a general approach for verifying safety properties of Lustre programs automatically. Key aspects of the approach are the choice of an expressive first-order logic in wh...
George Hagen, Cesare Tinelli