Sciweavers

223 search results - page 10 / 45
» Logic programs with monotone abstract constraint atoms
Sort
View
ECAI
2000
Springer
13 years 11 months ago
Logic Programs with Compiled Preferences
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
James P. Delgrande, Torsten Schaub, Hans Tompits
ICLP
1995
Springer
13 years 11 months ago
Operational Semantics of Constraint Logic Programs with Coroutining
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
Andreas Podelski, Gert Smolka
ECSQARU
2005
Springer
14 years 27 days ago
A Possibilistic Inconsistency Handling in Answer Set Programming
Abstract. Both in classical logic and in Answer Set Programming, inconsistency is characterized by non existence of a model. Whereas every formula is a theorem for inconsistent set...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
ESOP
2001
Springer
13 years 12 months ago
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-G...
LPNMR
2007
Springer
14 years 1 months ago
CPP: A Constraint Logic Programming Based Planner with Preferences
Abstract. We describe the development of a constraint logic programming based system, called CPP, which is capable of generating most preferred plans with respect to a user’s pre...
Phan Huy Tu, Tran Cao Son, Enrico Pontelli