1990 · 26 citations · 3 references
ComputingComputer ScienceLogicProgramming LanguagesTheory Of ComputationConstraint ProgrammingConstraint SatisfactionConstraint SolvingLogic ProgrammingMathematical LogicConstraint EquationsConstraint Logic ProgrammingDeclarative SemanticsFloating-point ArithmeticInterval Constraints
Prolog can be extended by a system of constraints on closed intervals to perform declarative relational arithmetic. Imposing constraints on an interval can narrow its range and propagate the narrowing to other intervals related to it by constraint equations or inequalities. Relational interval arithmetic can be used to contain floating point errors and, when combined with Prolog backtracking, to obtain numeric solutions to linear and non-linear rational constraint satisfaction problems over the reals (e.g. n-degree polynomial equations). This technique differs from other constraint logic programming (CLP) systems like CLP(!) or Prolog-III in that it does not do any symbolic processing. 1 Introduction In most programming languages arithmetic operations are performed by a functional evaluation mechanism. This is also true for logic programming languages such as Prolog even though such mechanisms are ill-suited to its generally relational nature. Arithmetic in Prolog is essentially no d...
3
Constraint propagation with interval labels
Ernest Davis · Artificial Intelligence · 1987 · 528 citations
Opening the Prolog III universe
Alain Colmerauer · BYTE archive · 1987 · 101 citations