86 search results - page 7 / 18 » Models and quantifier elimination for quantified Horn formul... |
CSL
2008
Springer
13 years 9 months ago
2008
Springer
We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first approach, one deals with finite fragments of the theory (g...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We have previously introduced role logic as a notation for describing properties of relational structures in shape analysis, databases and knowledge bases. A natural fragment of ro...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
ENTCS
2008
13 years 7 months ago
2008
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
ICLP
1990
Springer
13 years 11 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...