Sciweavers

2084 search results - page 62 / 417
» Set Constraints in Logic Programming
Sort
View
CADE
2001
Springer
14 years 8 months ago
A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities
The modalities of Dynamic Logic refer to the final state of a program execution and allow to specify programs with pre- and postconditions. In this paper, we extend Dynamic Logic w...
Bernhard Beckert, Steffen Schlager
FSS
2008
145views more  FSS 2008»
13 years 8 months ago
A logic programming framework for possibilistic argumentation: Formalization and logical properties
In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has s...
Teresa Alsinet, Carlos Iván Chesñeva...
CORR
2004
Springer
136views Education» more  CORR 2004»
13 years 7 months ago
Automatic Generation of CHR Constraint Solvers
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tab...
Slim Abdennadher, Christophe Rigotti
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 7 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
ICLP
2011
Springer
12 years 11 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...