Sciweavers

86 search results - page 9 / 18
» Models and quantifier elimination for quantified Horn formul...
Sort
View
JSYML
2000
103views more  JSYML 2000»
13 years 7 months ago
A Model Complete Theory of Valued D-Fields
The notion of a D-ring, generalizing that of a differential or a difference ring, is introduced. Quantifier elimination and a version of the AxKochen-Ershov principle is proven for...
Thomas Scanlon
JANCL
2008
170views more  JANCL 2008»
13 years 7 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
ENTCS
2008
96views more  ENTCS 2008»
13 years 7 months ago
Undecidability of Model Checking in Brane Logic
The Brane Calculus is a calculus intended to model the structure and the dynamics of biological membranes. In order to express properties of systems in this calculus, in previous ...
Giorgio Bacci, Marino Miculan
ACL
1993
13 years 8 months ago
A Complete and Recursive Feature Theory
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
Rolf Backofen, Gert Smolka
CADE
2005
Springer
14 years 7 months ago
A Proof-Producing Decision Procedure for Real Arithmetic
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
Sean McLaughlin, John Harrison