8094 search results - page 51 / 1619 » Improvements in Formula Generalization |
LATIN
2004
Springer
14 years 2 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...
ECAI
2006
Springer
14 years 19 days ago
2006
Springer
Various problems in AI can be solved by translating them into a quantified boolean formula (QBF) and evaluating the resulting encoding. In this approach, a QBF solver is used as a ...
IGPL
1998
13 years 8 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...
ESA
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
LANMR
2007
13 years 10 months ago
2007
Given a propositional formula X, we present a mapping that constructs a general program P, such that the maximal models of X correspond to the stable models of P, after intersectin...