Sciweavers

276 search results - page 3 / 56
» Constraint Propagation as a Proof System
Sort
View
ENTCS
2008
85views more  ENTCS 2008»
13 years 5 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset
CSCLP
2005
Springer
13 years 11 months ago
Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
Thom W. Frühwirth
AMC
2007
100views more  AMC 2007»
13 years 5 months ago
An alternative proof for the explicit equations of motion for mechanical systems with independent non-ideal constraints
An alternative proof for the explicit equations of motion for mechanical systems with independent non-ideal constraints is proposed in this paper. These equations are derived with...
Po Chih Chen, Chia-Ou Chang, W. T. Chang Chien
TACAS
1995
Springer
90views Algorithms» more  TACAS 1995»
13 years 9 months ago
A Constraint Oriented Proof Methodology Based on Modal Transition Systems
Kim Guldstrand Larsen, Bernhard Steffen, Carsten W...
CADE
2003
Springer
14 years 6 months ago
Proof Search and Proof Check for Equational and Inductive Theorems
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
Eric Deplagne, Claude Kirchner, Hélè...