Sciweavers

290 search results - page 33 / 58
» Logical Properties of Name Restriction
Sort
View
CTCS
1989
Springer
14 years 2 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002
AAAI
2006
13 years 11 months ago
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
AI
2010
Springer
14 years 1 months ago
Argumentation-Based Reasoning with Inconsistent Knowledge Bases
Abstract. In this paper, we present an argumentation-based approach to dealing with inconsistency occurring in knowledge bases. We investigate several important logical properties ...
Xiaowang Zhang, Zhihu Zhang, Dai Xu, Zuoquan Lin
ENTCS
2006
125views more  ENTCS 2006»
13 years 10 months ago
Liveness Checking as Safety Checking for Infinite State Spaces
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
Viktor Schuppan, Armin Biere
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 5 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi