1486 search results - page 80 / 298 » A Logically Saturated Extension of |
CADE
2008
Springer
14 years 9 months ago
2008
Springer
One of the keys to the success of the Thousands of Problems for Theorem Provers (TPTP) problem library and related infrastructure is the consistent use of the TPTP language. This p...
NMR
2004
Springer
14 years 2 months ago
2004
Springer
We develop an Answer Set Programming formalism based on Default Logic. We show that computing generating sets of extensions in this formalism captures all ΣP 2 search problems.
TPHOL
1992
IEEE
14 years 1 months ago
1992
IEEE
The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic un...
SLOGICA
2008
13 years 9 months ago
2008
We give a brief account of some de Finetti style representation theorems for probability functions satisfying Spectrum Exchangeability in Polyadic Inductive Logic, together with ap...
JSYML
2000
13 years 9 months ago
2000
The choice construct (choose x : '(x)) is useful in software speci cations. We study extensions of rst-order logic with the choice construct. We prove some results about Hilb...