Sciweavers

1097 search results - page 13 / 220
» Revision Programming = Logic Programming Integrity Constra...
Sort
View
PLILP
1994
Springer
15 years 6 months ago
clp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving
We present the design and the implementation of clp(B): a boolean constraint solver inside the Constraint Logic Programming paradigm. This solver is based on local propagation meth...
Philippe Codognet, Daniel Diaz
WLP
1997
Springer
15 years 6 months ago
Constrained Partial Deduction
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
Michael Leuschel, Danny De Schreye
DKE
2010
167views more  DKE 2010»
15 years 2 months ago
The consistency extractor system: Answer set programs for consistent query answering in databases
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...
Mónica Caniupán Marileo, Leopoldo E....
SUM
2007
Springer
15 years 8 months ago
The Consistency Extractor System: Querying Inconsistent Databases Using Answer Set Programs
Abstract. We present the Consistency Extractor System (ConsEx) that uses answer set programming to compute consistent answers to first-order queries posed to relational databases ...
Mónica Caniupán Marileo, Leopoldo E....
174
Voted
ICLP
2011
Springer
14 years 6 months ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...