700 search results - page 42 / 140 » On Termination of Constraint Logic Programs |
IPPS
2002
IEEE
15 years 4 months ago
2002
IEEE
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
EPIA
2005
Springer
15 years 4 months ago
2005
Springer
This paper introduces an original 2-valued semantics for Normal Logic Programs (NLP), which conservatively extends the Stable Model semantics (SM) to all normal programs. The dist...
PLILP
1993
Springer
15 years 3 months ago
1993
Springer
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
ICLP
1991
Springer
15 years 2 months ago
1991
Springer
An extended logic programming language embodying sets is developed in successive stages, introducing at each stage simple set dictions and operations, and discussing their operati...
CADE
2005
Springer
15 years 11 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...