Sciweavers

245 search results - page 28 / 49
» Class Algebra as a Description Logic
Sort
View
CSL
2001
Springer
15 years 11 months ago
Capture Complexity by Partition
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 ...
Yijia Chen, Enshao Shen
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 6 months ago
Programs as polygraphs: computability and complexity
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....
Guillaume Bonfante, Yves Guiraud
DLOG
2011
14 years 10 months ago
Concept Model Semantics for DL Preferential Reasoning
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...
Arina Britz, Thomas Meyer, Ivan José Varzin...
FUIN
2007
92views more  FUIN 2007»
15 years 6 months ago
Foundations of Modal Deductive Databases
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...
Linh Anh Nguyen
FOIS
2006
15 years 8 months ago
Approximation of Ontologies in CASL
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...
Klaus Lüttich