Views
5 years ago

Small Formulas for Large Programs: On-line Constraint ...

Small Formulas for Large Programs: On-line Constraint ...

Leaves of a Formula ●

Leaves of a Formula ● We consider quantifier­free formulas using the boolean connectives AND, OR, and NOT over any decidable theory . ● We assume formulas are in NNF. ● A formula that does not contain conjunction or disjunction is an atomic formula. ● Each syntactic occurrence of an atomic formula is a leaf. ● Example: :f(x) = 1 _ (:f(x) = 1 ^ x + y · 1) 3 distinct leaves

Redundant Leaves ● A leaf L is non­constraining in formula F if replacing L with true in F yields an equivalent formula. ● L is non­relaxing in F if replacing L with false is equivalent to F. ● L is redundant if it is non­constraining or non­relaxing. x = y | {z } L 0 ^ (f(x) = 1 | {z } L 1 Non­relaxing because formula is equivalent when it is replaced by false. _ (f(y) = 1 | {z } L 2 ^ x + y · 1)) | {z } L 3 Both non­constraining and non­relaxing.

Multiparadigm Constraint Programming Languages (Cognitive ...
Constraint Logic Programming Using ECLiPSe
SCIP - Solving Constraint Integer Programs - ZIB
Answer Sets: From Constraint Programming Towards Qualitative ...
Weighted Automata, Constraint Programming, and Large ...
Solving small VRPTWs with Constraint Programming Based Column ...
The Thales constraint programming framework for on-line planning ...
Program Analysis as Constraints SOlving
Constraint Graph Analysis of Multithreaded Programs
Towards Stochastic Constraint Programming: A Study of On-Line ...
Foundations of Constraint programming and CONstraint Logic ...
Logical Constraints in Integer Programs
Logic Programming with Constraints - Webdocs Cs Ualberta
Parallel Consistency in Constraint Programming
Distributed Constraint Programming with Agents
Modelling in Constraint Programming - Cork Constraint Computation ...
Constraint Lingo: Towards high-level constraint programming
Constraint Reduction for Linear Programs with Many Constraints
Soft Constraints in Integer Linear Programs
Constraint Programming for Timetabling - Masaryk University
Completable Partial Solutions in Constraint Programming and ...
A hybrid constraint programming and semidefinite programming ...