Sciweavers

348 search results - page 34 / 70
» Using Case-Based Reasoning to Write Constraint Programs
Sort
View
LICS
1995
IEEE
15 years 6 months ago
Structural Cut Elimination
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
Frank Pfenning
CP
2004
Springer
15 years 7 months ago
Preprocessing Techniques for Distributed Constraint Optimization
Abstract. Although algorithms for Distributed Constraint Optimization Problems (DCOPs) have emerged as a key technique for distributed reasoning, their application faces significa...
Syed Muhammad Ali, Sven Koenig, Milind Tambe
CCIA
2005
Springer
15 years 8 months ago
Comparison of Strategies Based on Evolutionary Computation for the Design of Similarity Functions
One of the main keys in case-based reasoning system is the retrieval phase, where the most similar cases are retrieved by means of a similarity function. According to the problem, ...
Albert Fornells-Herrera, J. Camps Dausà, El...
ICLP
1997
Springer
15 years 6 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
CP
2003
Springer
15 years 7 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann