245 search results - page 28 / 49 » Class Algebra as a Description Logic |
80
Voted
CSL
2001
Springer
15 years 5 months ago
2001
Springer
We show in this paper a special extended logic, partition logic based on so called partition quantifiers, is able to capture some important complexity classes NP, P and NL by its ...
90
Voted
CORR
2007
Springer
15 years 14 days ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
119
Voted
DLOG
2011
14 years 4 months ago
2011
Abstract. The preferential and rational consequence relations first studied by Lehmann and colleagues play a central role in non-monotonic reasoning, not least because they provid...
FUIN
2007
15 years 13 days ago
2007
We give formulations for modal deductive databases and present a modal query language called MDatalog. We define modal relational algebras and give the seminaive evaluation algor...
107
Voted
FOIS
2006
15 years 1 months ago
2006
In this paper we present methods to generate a Description Logic (DL) theory from a given First Order Logic (FOL) theory, such that each DL axiom is entailed by the given FOL theor...