86 search results - page 6 / 18 » Models and quantifier elimination for quantified Horn formul... |
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...
ESOP
2008
Springer
13 years 9 months ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
AISC
2008
Springer
13 years 9 months ago
2008
Springer
We use higher-order logic to verify a quantifier elimination procedure for linear arithmetic over ordered fields, where the coefficients of variables are multivariate polynomials o...
ISSRE
2002
IEEE
14 years 12 days ago
2002
IEEE
An important aspect of developing models relating the number and type of faults in a software system to a set of structural measurement is defining what constitutes a fault. By de...
AI
2008
Springer
13 years 7 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...