Results 1  10
of
26
Unions of NonDisjoint Theories and Combinations of Satisfiability Procedures
 THEORETICAL COMPUTER SCIENCE
, 2001
"... In this paper we outline a theoretical framework for the combination of decision procedures for constraint satisfiability. We describe a general combination method which, given a procedure that decides constraint satisfiability with respect to a constraint theory T1 and one that decides constraint s ..."
Abstract

Cited by 35 (3 self)
 Add to MetaCart
In this paper we outline a theoretical framework for the combination of decision procedures for constraint satisfiability. We describe a general combination method which, given a procedure that decides constraint satisfiability with respect to a constraint theory T1 and one that decides constraint satisfiability with respect to a constraint theory T2, produces a procedure that (semi)decides constraint satisfiability with respect to the union of T1 and T2. We provide a number of modeltheoretic conditions on the constraint language and the component constraint theories for the method to be sound and complete, with special emphasis on the case in which the signatures of the component theories are nondisjoint. We also describe some general classes of theories to which our combination results apply, and relate our approach to some of the existing combination methods in the field.
Theorem proving with structured theories (full report
, 2001
"... Motivated by the problem of query answering over multiple structured commonsense theories, we exploit graphbased techniques to improve the efficiency of theorem proving for structured theories. Theories are organized into subtheories that are minimally connected by the literals they share. We prese ..."
Abstract

Cited by 27 (6 self)
 Add to MetaCart
Motivated by the problem of query answering over multiple structured commonsense theories, we exploit graphbased techniques to improve the efficiency of theorem proving for structured theories. Theories are organized into subtheories that are minimally connected by the literals they share. We present messagepassing algorithms that reason over these theories using consequence finding, specializing our algorithms for the case of firstorder resolution, and for batch and concurrent theorem proving. We provide an algorithm that restricts the interaction between subtheories by exploiting the polarity of literals. We attempt to minimize the reasoning within each individual partition by exploiting existing algorithms for focused incremental and general consequence finding. Finally, we propose an algorithm that compiles each subtheory into one in a reduced sublanguage. We have proven the soundness and completeness of all of these algorithms. 1
Relating Semantic and ProofTheoretic Concepts for Polynomial Time Decidability of Uniform Word Problems
 In Proceedings 16th IEEE Symposium on Logic in Computer Science, LICS'2001
, 2001
"... In this paper we compare three approaches to polynomial time decidability for uniform word problems for quasivarieties. Two of the approaches, by Evans and Burris, respectively, are semantical, referring to certain embeddability and axiomatizability properties. The third approach is more prooftheor ..."
Abstract

Cited by 22 (2 self)
 Add to MetaCart
In this paper we compare three approaches to polynomial time decidability for uniform word problems for quasivarieties. Two of the approaches, by Evans and Burris, respectively, are semantical, referring to certain embeddability and axiomatizability properties. The third approach is more prooftheoretic in nature, inspired by McAllester's concept of local inference. We define two closely related notions of locality for equational Horn theories and show that both the criteria by Evans and Burris lie in between these two concepts. In particular, the variant we call stable locality will be shown to subsume both Evans' and Burris' method.
Combination of Constraint Systems II: Rational Amalgamation
 Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming
, 1996
"... In two earlier papers, the concept of "free amalgamation" has been introduced as a general methodology for interweaving solution structures for symbolic constraints, and it was shown how constraint solvers for two components can be lifted to a constraint solver for the free amalgam. Here w ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
In two earlier papers, the concept of "free amalgamation" has been introduced as a general methodology for interweaving solution structures for symbolic constraints, and it was shown how constraint solvers for two components can be lifted to a constraint solver for the free amalgam. Here we discuss a second general way for combining solution domains, called rational amalgamation. In praxis, rational amalgamation seems to be the preferred combination principle if the two solution structures to be combined are "rational" or "nonwellfounded" domains. It represents, e.g., the way how rational trees and rational lists are interwoven in the solution domain of Prolog III, and a variant has been used by W. Rounds for combining feature structures and hereditarily finite nonwellfounded sets. We show that rational amalgamation is a general combination principle, applicable to a large class of structures. As in the case of free amalgamation, constraint solvers for two component structures can be combined to a constraint solver for their rational amalgam. From this algorithmic point of view, rational amalgamation seems to be interesting since the combination technique for rational amalgamation avoids one source of nondeterminism that is needed in the corresponding scheme for free amalgamation.
Optimisation Techniques for Combining Constraint Solvers
 IN MAARTEN DE RIJKE AND
, 1998
"... In recent years, techniques that had been developed for the combination of unification algorithms for equational theories were extended to combining constraint solvers. These techniques inherited an old deficit that was already present in the combination of equational theories which makes them rathe ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
In recent years, techniques that had been developed for the combination of unification algorithms for equational theories were extended to combining constraint solvers. These techniques inherited an old deficit that was already present in the combination of equational theories which makes them rather unsuitable for practical use: The underlying combination algorithms are highly nondeterministic. This paper is concerned with the practical problem of how to optimise the combination method of Baader and Schulz. We present an optimisation method, called the deductive method, which uses specific algorithms for the components to reach certain decisions deterministically. We also give a strategy how to select an order of nondeterministic decisions. Run time tests of our implementation indicate that the optimised combination method yields combined decision procedures that are efficient enough to be used in practice.
Dealing with Incomplete Knowledge on CLP(FD) Variable Domains
 ACM Transactions on Programming Languages and Systems
, 2003
"... Constraint Logic Programming languages on Finite Domains, CLP(FD), provide a declarative framework for Artificial Intelligence problems. However, in many real life cases, domains are not known and must be acquired or computed. ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Constraint Logic Programming languages on Finite Domains, CLP(FD), provide a declarative framework for Artificial Intelligence problems. However, in many real life cases, domains are not known and must be acquired or computed.
Combining Constraint Solving
, 2001
"... this paper. On the one hand, dening a semantics for the combined system may depend on methods and results from formal logic and universal algebra. On the other hand, an ecient combination of the actual constraint solvers often requires the possibility of communication and cooperation between the sol ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
this paper. On the one hand, dening a semantics for the combined system may depend on methods and results from formal logic and universal algebra. On the other hand, an ecient combination of the actual constraint solvers often requires the possibility of communication and cooperation between the solvers.
Combining NonDisjoint Theories
 University of Siena, Italy
, 2001
"... In this paper we present a new method for combining ground decision procedures for rstorder theories over nondisjoint signatures. ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
In this paper we present a new method for combining ground decision procedures for rstorder theories over nondisjoint signatures.