Sciweavers

3738 search results - page 118 / 748
» Parametrized Logic Programming
Sort
View
LPNMR
2001
Springer
14 years 16 days ago
A Comparative Study of Well-Founded Semantics for Disjunctive Logic Programs
Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, no consensus has been reac...
Kewen Wang
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
FOSSACS
2006
Springer
13 years 11 months ago
Propositional Dynamic Logic with Recursive Programs
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
Christof Löding, Olivier Serre
WFLP
2000
Springer
163views Algorithms» more  WFLP 2000»
13 years 11 months ago
Cooperative Constraint Functional Logic Programming
We describe the current status of the development of CFLP, a system which aims at the integration of the best features of functional logic programming (FLP), cooperative constrain...
Mircea Marin, Tetsuo Ida
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