504 search results - page 23 / 101 » The Complexity of Symmetry-Breaking Formulas |
VMCAI
2009
Springer
14 years 4 months ago
2009
Springer
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...
DALT
2005
Springer
14 years 3 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
LATIN
2004
Springer
14 years 3 months ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
ICDT
2001
ACM
14 years 2 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
IGPL
1998
13 years 9 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...