Sciweavers

215 search results - page 13 / 43
» Connecting a Logical Framework to a First-Order Logic Prover
Sort
View
ML
2006
ACM
143views Machine Learning» more  ML 2006»
14 years 11 months ago
Mathematical applications of inductive logic programming
The application of Inductive Logic Programming to scientific datasets has been highly successful. Such applications have led to breakthroughs in the domain of interest and have dri...
Simon Colton, Stephen Muggleton
CADE
2009
Springer
16 years 7 days ago
Progress in the Development of Automated Theorem Proving for Higher-Order Logic
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well established infrastructure supporting research, development, and deployment of first-ord...
Chad E. Brown, Christoph Benzmüller, Frank Th...
SIGMOD
2005
ACM
114views Database» more  SIGMOD 2005»
15 years 11 months ago
Semantic characterizations of navigational XPath
We give semantic characterizations of the expressive power of navigational XPath (also called Core XPath) in terms of first order logic. XPath can be used to specify sets of nodes...
Maarten Marx, Maarten de Rijke
CADE
2011
Springer
13 years 11 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
BIRTHDAY
2010
Springer
14 years 12 months ago
Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners)
Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higher-order logic). Furthermore, off-the-shelf reasoning syste...
Christoph Benzmüller