4573 search results - page 841 / 915 » Automated Reasoning |
FUIN
2010
14 years 10 months ago
2010
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...
125
click to vote
SEMWEB
2010
Springer
14 years 6 months ago
2010
Springer
The Semantic Web emphasizes encoding over modeling. It is built on the premise that ontology engineers can say something useful about the semantics of vocabularies by expressing th...
112
click to vote
VSTTE
2012
Springer
13 years 7 months ago
2012
Springer
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
114
click to vote
TPHOL
1997
IEEE
15 years 4 months ago
1997
IEEE
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...
CICLING
2007
Springer
15 years 6 months ago
2007
Springer
The present paper describes how dependency analysis can be used to automatically extract from a corpus a set of cases - and an accompanying vocabulary - which enable a template-bas...