Results 1  10
of
5,362,493
Continuous FirstOrder Constraint Satisfaction
 ARTIFICIAL INTELLIGENCE, AUTOMATED REASONING, AND SYMBOLIC COMPUTATION, NUMBER 2385 IN LNCS
, 2002
"... This paper shows how to use constraint programming techniques for solving firstorder constraints over the reals (i.e., formulas in the firstorder predicate language over the structure of the real numbers). More specifically, based on a narrowing operator that implements an arbitrary notion of con ..."
Abstract

Cited by 27 (12 self)
 Add to MetaCart
This paper shows how to use constraint programming techniques for solving firstorder constraints over the reals (i.e., formulas in the firstorder predicate language over the structure of the real numbers). More specifically, based on a narrowing operator that implements an arbitrary notion
Real FirstOrder Constraints Are Stable with Probability One
, 2001
"... Let a firstorder constraint be a formula in the firstorder predicate language over the reals with predicate sumbols and >, and equality expressed via two inequalities. A closed firstorder constraint is stable iff its truth value does not change under small perturbations of its constants. In th ..."
Abstract
 Add to MetaCart
Let a firstorder constraint be a formula in the firstorder predicate language over the reals with predicate sumbols and >, and equality expressed via two inequalities. A closed firstorder constraint is stable iff its truth value does not change under small perturbations of its constants
Solving FirstOrder Constraints in the Theory of the Evaluated Trees
"... We present in this paper a general algorithm for solving firstorder constraints in the theory T of the evaluated trees which is a combination of the theory of finite or infinite trees and the theory of the rational numbers with addition and subtraction and a linear dense order relation. The algorit ..."
Abstract
 Add to MetaCart
We present in this paper a general algorithm for solving firstorder constraints in the theory T of the evaluated trees which is a combination of the theory of finite or infinite trees and the theory of the rational numbers with addition and subtraction and a linear dense order relation
A characterisation of firstorder constraint satisfaction problems
 LOGICAL METHODS COMPUT. SCI
, 2007
"... We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction problem is firstorder definable: we show the general problem to ..."
Abstract

Cited by 34 (11 self)
 Add to MetaCart
We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction problem is firstorder definable: we show the general problem
On FirstOrder Constraint Checking in ObjectOriented Databases
, 1999
"... This paper deals with the validity checking of declarative integrity constraints on objectoriented databases. We will consider that an instance of an objectoriented database scheme can be seen as a relational structure and the investigated constraints are expressed as firstorder formulas wher ..."
Abstract
 Add to MetaCart
This paper deals with the validity checking of declarative integrity constraints on objectoriented databases. We will consider that an instance of an objectoriented database scheme can be seen as a relational structure and the investigated constraints are expressed as firstorder formulas
FIRSTORDER CONSTRAINT SYSTEMS WITH MULTIPLE CONGRUENCE RELATIONS
"... Abstract. We investigate the problem of deciding firstorder theories of finite trees with several distinguished congruence relations, each of them given by some equational axioms. We give an automatabased solution for the case where the different equational axiom systems are linear and variabledi ..."
Abstract
 Add to MetaCart
Abstract. We investigate the problem of deciding firstorder theories of finite trees with several distinguished congruence relations, each of them given by some equational axioms. We give an automatabased solution for the case where the different equational axiom systems are linear and variable
FirstOrder Constraint Systems With Multiple Congruence Relations
"... Abstract. We investigate the problem of deciding firstorder theories of finite trees with several distinguished congruence relations, each of them given by some equational axioms. We give an automatabased solution for the case where the different equational axiom systems are linear and variabledi ..."
Abstract
 Add to MetaCart
Abstract. We investigate the problem of deciding firstorder theories of finite trees with several distinguished congruence relations, each of them given by some equational axioms. We give an automatabased solution for the case where the different equational axiom systems are linear and variable
(2006)" Solving FirstOrder Constraints in the Theory of the Evaluated Trees
, 2010
"... Abstract. We describe in this paper a general algorithm for solving firstorder constraints in the theory T of the evaluated trees which is a combination of the theory of finite or infinite trees and the theory of the rational numbers with addition, subtraction and a linear dense order relation. It ..."
Abstract
 Add to MetaCart
Abstract. We describe in this paper a general algorithm for solving firstorder constraints in the theory T of the evaluated trees which is a combination of the theory of finite or infinite trees and the theory of the rational numbers with addition, subtraction and a linear dense order relation
Convergent Approximate Solving of FirstOrder Constraints by Approximate Quantifiers
 ACM Trans. Comput. Logic
, 2001
"... Exactly solving firstorder constraints (i.e., firstorder formulas over a certain prede ned structure) can be a very hard, or even undecidable problem. In continuous structures like the real numbers it is promising to compute approximate solutions instead of exact ones. However, the quantifiers of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Exactly solving firstorder constraints (i.e., firstorder formulas over a certain prede ned structure) can be a very hard, or even undecidable problem. In continuous structures like the real numbers it is promising to compute approximate solutions instead of exact ones. However, the quantifiers
Results 1  10
of
5,362,493