Results 1  10
of
10
Solving Mixed and Conditional Constraint Satisfaction Problems
 Constraints
, 2003
"... Constraints are a powerful general paradigm for representing knowledge in intelligent systems. The standard constraint satisfaction paradigm involves variables over a discrete value domain and constraints which restrict the solutions to allowed value combinations. This standard paradigm is inapplica ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
(Show Context)
Constraints are a powerful general paradigm for representing knowledge in intelligent systems. The standard constraint satisfaction paradigm involves variables over a discrete value domain and constraints which restrict the solutions to allowed value combinations. This standard paradigm is inapplicable to problems which are either: (a) mixed, involving both numeric and discrete variables, or (b) conditional? containing variables whose existence depends on the values chosen for other variables, or (c) both, conditional and mixed.
Cooperation and Coordination of Constraint Solvers
, 2001
"... Declarative programming languages base on the idea that programs should be as close as possible to the problem specification and domain. Programs of these languages usually consist of directly formulated mathematical objects, i.e. relations and functions. Accordingly, declarative languages are disti ..."
Abstract

Cited by 13 (10 self)
 Add to MetaCart
Declarative programming languages base on the idea that programs should be as close as possible to the problem specification and domain. Programs of these languages usually consist of directly formulated mathematical objects, i.e. relations and functions. Accordingly, declarative languages are distinguished into logic, functional, functionallogic, and constraint programming languages.
Better Communication for Tighter Cooperation
 In First Intl. Conference on Computational Logic (CL 2000), LNAI 1861
, 2000
"... We propose a general scheme for the cooperation of di#erent constraint solvers. A uniform interface for constraint solvers allows to formally specify information exchange between them and it enables the development of an open and very flexible combination mechanism. This mechanism allows the def ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
(Show Context)
We propose a general scheme for the cooperation of di#erent constraint solvers. A uniform interface for constraint solvers allows to formally specify information exchange between them and it enables the development of an open and very flexible combination mechanism. This mechanism allows the definition of a wide range of di#erent cooperation strategies according to the current requirements such that our overall system forms a general framework for cooperating constraint solvers.
RuleBased Constraint Programming
 Fundamenta Informaticae
, 1998
"... In this paper we present a view of constraint programming based on the notion of rewriting controlled by strategies. We argue that this concept allows us to describe in a unified way the constraint solving mechanism as well as the metalanguage needed to manipulate the constraints. This has the a ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
(Show Context)
In this paper we present a view of constraint programming based on the notion of rewriting controlled by strategies. We argue that this concept allows us to describe in a unified way the constraint solving mechanism as well as the metalanguage needed to manipulate the constraints. This has the advantage to provide descriptions that are very close to the proof theoretical setting used now to describe constraint manipulations like unification or numerical constraint solving. We examplify the approach by presenting examples of constraint solvers descriptions and combinations written in the ELAN language. 1
Cooperating Constraint Solvers
 In Sixth International Conference on Principles and Practice of Constraint Programming – CP. LNCS
, 2000
"... We propose a general scheme for the cooperation of different constraint solvers. On top of a uniform interface for constraint we stepwise develop reduction systems which describe the behaviour of an overall combined system. The modularity of our definitions of reduction relations at different levels ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
We propose a general scheme for the cooperation of different constraint solvers. On top of a uniform interface for constraint we stepwise develop reduction systems which describe the behaviour of an overall combined system. The modularity of our definitions of reduction relations at different levels allows the definition of cooperation strategies for the solvers according to the current requirements such that our overall system forms a general framework for cooperating solvers.
Constraint Solving in Logic Programming and in Automated Deduction: a Comparison
, 1998
"... . Constraint solving has been successfully employed in diverse areas such as Operation Research, Planning, Logic Programming, and Automated Deduction. This has led to the development of a number of specialised approaches as well as to the adoption of different integration schemes and methodologies. ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
. Constraint solving has been successfully employed in diverse areas such as Operation Research, Planning, Logic Programming, and Automated Deduction. This has led to the development of a number of specialised approaches as well as to the adoption of different integration schemes and methodologies. In this paper we introduce an approach to incorporate constraint solving in term rewriting and we compare it with the Constraint Logic Programming scheme. We compare the two approaches both at the theoretical and at the implementational level and discuss potentials for crossfertilisation. 1 Introduction Constraint solving aims at the development of efficient procedures tailored to restricted domains as well as to the integration of such procedures into general purpose reasoners. Constraint solving has been successfully employed in diverse areas such as Operation Research, Planning, Logic Programming, and Automated Deduction. This has led to the development of a number of specialised approa...
Structural Engineering Design Support By Constraint Satisfaction
, 2000
"... Design tasks in structural engineering have always involved the use of constraints to formulate design requirements. Most existing algorithms for constraint satisfaction require input consisting of binary constraints on variables that have discrete values. Such restrictions limit their use in struc ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Design tasks in structural engineering have always involved the use of constraints to formulate design requirements. Most existing algorithms for constraint satisfaction require input consisting of binary constraints on variables that have discrete values. Such restrictions limit their use in structural engineering since typical structural design tasks involve discrete and numerical variables. This paper provides an approach for decision support through approximating solution spaces of such constraint problems by local consistency. The approach is demonstrated for the selection of appropriate wind bracing for single story steelframed buildings involving more than hundred variables.
Constraint Satisfaction Methods for Applications in Engineering
 Engineering With Computers
, 2000
"... Constraints provide declarative descriptions of important requirements related to engineering projects. Most existing algorithms for constraint satisfaction require input consisting of binary constraints on variables that have discrete values. Such restrictions limit their use in engineering since c ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Constraints provide declarative descriptions of important requirements related to engineering projects. Most existing algorithms for constraint satisfaction require input consisting of binary constraints on variables that have discrete values. Such restrictions limit their use in engineering since complex constraints, involving several variables that have discrete and numeric values, are common. This paper provides an approach for decision support through approximating solution spaces that are defined by constraints. Our algorithm is not limited to a specific type of constraint but handles numeric and discrete variables in the same framework. Since a new type of local consistency narrows down the search space effectively, fullscale engineering tasks, such as designs involving hundreds of variables, are accommodated without excessive computational complexity. The approach is demonstrated for selection of appropriate wind bracing for single story steelframed buildings. Results may be used for input into other tools containing algorithms such as those o ering i) higher levels of consistency, ii) optimally directed pointsolution search and iii) simulation behavior. Finally, extension to dynamic constraint satisfaction using different combinations of activation conditions is straightforward. It is expected that this approach will improve the performance of many existing and future computeraided engineering tools.
Revisiting the Equivalence of Shininess and Politeness
"... Abstract. The NelsonOppen method [4] allows the combination of satisfiability procedures of stably infinite theories with disjoint signatures. Due to its importance, several attempts to extend the method to different and wider classes of theories were made. In 2005, it was shown that shiny [9] an ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. The NelsonOppen method [4] allows the combination of satisfiability procedures of stably infinite theories with disjoint signatures. Due to its importance, several attempts to extend the method to different and wider classes of theories were made. In 2005, it was shown that shiny [9] and polite [6] theories could be combined with an arbitrary theory (the relationship between these classes was analysed in [6]). Later, a stronger notion of polite theory was proposed, see [3], in order to overcome a subtle issue with a proof in [6]. In this paper, we analyse the relationship between shiny and strongly polite theories in the onesorted case. We show that a shiny theory with a decidable quantifierfree satisfiability problem is strongly polite and provide two different sufficient conditions for a strongly polite theory to be shiny. Based on these results, we derive a combination method for the union of a polite theory with an arbitrary theory.
Cooperation of Background Reasoners in Theory Reasoning by Residue Sharing
 Journal of Automated Reasoning
, 2000
"... . We propose a general way of combining background reasoners in theory reasoning. Using a restricted version of the Craig Interpolation Lemma, we show that background reasoner cooperation can be achieved as a form of constraint propagation, much in the spirit of existing combination methods for d ..."
Abstract
 Add to MetaCart
. We propose a general way of combining background reasoners in theory reasoning. Using a restricted version of the Craig Interpolation Lemma, we show that background reasoner cooperation can be achieved as a form of constraint propagation, much in the spirit of existing combination methods for decision procedures. In this case, constraint information is propagated across reasoners by exchanging residues over a common signature. As an application of our approach, we describe a multitheory version of the semantic tableau calculus. 1 Introduction Theory reasoning is a powerful deduction paradigm in which a generalpurpose reasoner is complemented by a specialized procedure, the background reasoner, which (semi)decides formula satisfiability with respect to a certain background theory. After the pioneering work of Stickel who devised a theory version of resolution [8], nearly all existing calculi for automatic reasoning have been extended to theory reasoning (see [2] for a surve...