4617 search results - page 394 / 924 » Automation of Diagrammatic Reasoning |
177
click to vote
DLOG
2008
15 years 9 months ago
2008
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR--a fragment of SROIQ witho...
149
click to vote
CL
2006
Springer
15 years 6 months ago
2006
Springer
Meta programming is the act of reasoning about a computational system. For example, a program in Prolog can reason about a program written in Smalltalk. Reflection is a more power...
179
click to vote
CADE
2009
Springer
16 years 1 months ago
2009
Springer
SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent deve...
191
click to vote
FTP
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...
188
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
Within the last years, especially since the work proposed by Dung in 1995, argumentation has emerged as a central issue in Artificial Intelligence. With the so called argumentatio...