scholarly journals A Characterisation of First-Order Constraint Satisfaction Problems

2007 ◽  
Vol 3 (4) ◽  
Author(s):  
Benoit Larose ◽  
Cynthia Loten ◽  
Claude Tardif
Keyword(s):  
Constraint Satisfaction ◽  
Constraint Satisfaction Problems ◽  
First Order ◽  
Order Constraint

scholarly journals Probabilistic Inference for Predicate Constraint Satisfaction

2020 ◽  
Vol 34 (02) ◽  
pp. 1644-1651
Author(s):  
Yuki Satake ◽  
Hiroshi Unno ◽  
Hinata Yanagi
Keyword(s):  
Graphical Models ◽  
Constraint Satisfaction ◽  
Linear Time ◽  
Predicate Logic ◽  
Probabilistic Inference ◽  
Search Space ◽  
Constraint Satisfaction Problems ◽  
Safety Properties ◽  
First Order ◽  
Guided Inductive

In this paper, we present a novel constraint solving method for a class of predicate Constraint Satisfaction Problems (pCSP) where each constraint is represented by an arbitrary clause of first-order predicate logic over predicate variables. The class of pCSP properly subsumes the well-studied class of Constrained Horn Clauses (CHCs) where each constraint is restricted to a Horn clause. The class of CHCs has been widely applied to verification of linear-time safety properties of programs in different paradigms. In this paper, we show that pCSP further widens the applicability to verification of branching-time safety properties of programs that exhibit finitely-branching non-determinism. Solving pCSP (and CHCs) however is challenging because the search space of solutions is often very large (or unbounded), high-dimensional, and non-smooth. To address these challenges, our method naturally combines techniques studied separately in different literatures: counterexample guided inductive synthesis (CEGIS) and probabilistic inference in graphical models. We have implemented the presented method and obtained promising results on existing benchmarks as well as new ones that are beyond the scope of existing CHC solvers.

scholarly journals Theory of finite or infinite trees revisited

2008 ◽  
Vol 8 (04) ◽  
pp. 431-489 ◽  
Author(s):  
KHALIL DJELLOUL ◽  
THI-BICH-HANH DAO ◽  
THOM FRÜHWIRTH
Keyword(s):  
Constraint Satisfaction ◽  
Decision Procedure ◽  
Constraint Satisfaction Problem ◽  
Free Variable ◽  
Constraint Solver ◽  
First Order ◽  
Infinite Trees ◽  
Order Constraint ◽  
Infinite Set ◽  
Rewriting Rules

AbstractWe present in this paper a first-order axiomatization of an extended theoryTof finite or infinite trees, built on a signature containing an infinite set of function symbols and a relationfinite(t), which enables to distinguish between finite and infinite trees. We show thatThas at least one model and prove its completeness by giving not only a decision procedure, but a full first-order constraint solver that gives clear and explicit solutions for any first-order constraint satisfaction problem inT. The solver is given in the form of 16 rewriting rules that transform any first-order constraintinto an equivalent disjunction φ of simple formulas such that φ is either the formulatrueor the formulafalseor a formula having at least one free variable, being equivalent neither totruenor tofalseand where the solutions of the free variables are expressed in a clear and explicit way. The correctness of our rules implies the completeness ofT. We also describe an implementation of our algorithm in CHR (Constraint Handling Rules) and compare the performance with an implementation in C++ and that of a recent decision procedure for decomposable theories.

scholarly journals Permutation groups with small orbit growth

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Manuel Bodirsky ◽  
Bertalan Bodor
Keyword(s):  
Automorphism Group ◽  
Constraint Satisfaction ◽  
Constraint Satisfaction Problem ◽  
Permutation Groups ◽  
First Order ◽  
Finite Covers

Abstract Let K exp + \mathcal{K}_{{\operatorname{exp}}{+}} be the class of all structures 𝔄 such that the automorphism group of 𝔄 has at most c ⁢ n d ⁢ n cn^{dn} orbits in its componentwise action on the set of 𝑛-tuples with pairwise distinct entries, for some constants c , d c,d with d < 1 d<1 . We show that K exp + \mathcal{K}_{{\operatorname{exp}}{+}} is precisely the class of finite covers of first-order reducts of unary structures, and also that K exp + \mathcal{K}_{{\operatorname{exp}}{+}} is precisely the class of first-order reducts of finite covers of unary structures. It follows that the class of first-order reducts of finite covers of unary structures is closed under taking model companions and model-complete cores, which is an important property when studying the constraint satisfaction problem for structures from K exp + \mathcal{K}_{{\operatorname{exp}}{+}} . We also show that Thomas’ conjecture holds for K exp + \mathcal{K}_{{\operatorname{exp}}{+}} : all structures in K exp + \mathcal{K}_{{\operatorname{exp}}{+}} have finitely many first-order reducts up to first-order interdefinability.

Sign in / Sign up

Export Citation Format

Share Document