Sciweavers

105 search results - page 3 / 21
» Computational Origami Construction as Constraint Solving and...
Sort
View
AISC
2004
Springer
14 years 28 days ago
Proof Search in Minimal Logic
ion Within Partial Deduction for Linear Logic . . . . . . . . . . . . . . . . . 52 P. K¨ungas A Decision Procedure for Equality Logic with Uninterpreted Functions . . . 66 O. Tver...
Helmut Schwichtenberg
RTA
1995
Springer
13 years 11 months ago
Prototyping Completion with Constraints Using Computational Systems
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
Hélène Kirchner, Pierre-Etienne More...
ICTAI
1996
IEEE
13 years 11 months ago
Binary CSP Solving as an Inference Process
We describe constraint solving using a rule-based approach. The distinction made between deduction rules and strategies by computational systems allows us to improve our understan...
Carlos Castro
SARA
2009
Springer
14 years 2 days ago
Rewriting Constraint Models with Metamodels
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may requir...
Raphaël Chenouard, Laurent Granvilliers, Rica...
PODS
2003
ACM
142views Database» more  PODS 2003»
14 years 7 months ago
Query containment and rewriting using views for regular path queries under constraints
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
Gösta Grahne, Alex Thomo