Sciweavers

292 search results - page 24 / 59
» First-order intensional logic
Sort
View
JAR
2008
77views more  JAR 2008»
13 years 7 months ago
Translating Higher-Order Clauses to First-Order Clauses
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. In order to integrate interactive provers with automatic ones, it is ...
Jia Meng, Lawrence C. Paulson
CSL
2009
Springer
13 years 11 months ago
Tree-Width for First Order Formulae
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
Isolde Adler, Mark Weyer
PODS
2004
ACM
117views Database» more  PODS 2004»
14 years 7 months ago
Conditional XPath, the First Order Complete XPath Dialect
XPath is the W3C?standard node addressing language for XML documents. XPath is still under development and its technical aspects are intensively studied. What is missing at presen...
Maarten Marx
KR
2000
Springer
13 years 11 months ago
Reduction rules and universal variables for first order tableaux and DPLL
Recent experimental results have shown that the strength of resolution, the propositional DPLL procedure, the KSAT procedure for description logics, or related tableau-like implem...
Fabio Massacci
CADE
2007
Springer
14 years 8 months ago
First Order Reasoning on a Large Ontology
We present results of our work on using first order theorem proving to reason over a large ontology (the Suggested Upper Merged Ontology ? SUMO), and methods for making SUMO suita...
Adam Pease, Geoff Sutcliffe