3244 search results - page 237 / 649 » Extensions to Description Logics |
191
click to vote
LANMR
2007
15 years 8 months ago
2007
Abstract We introduce some differences in the style defeasible information is represented and inferences are made in nonmonotonic reasoning. These, at first sight harmless, chang...
155
click to vote
CADE
2008
Springer
16 years 6 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...
165
click to vote
NMR
2004
Springer
15 years 12 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.
139
click to vote
TPHOL
1992
IEEE
15 years 10 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...
150
click to vote
SLOGICA
2008
15 years 6 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...