Browsing by Author "Wolter F"
Now showing items 110 of 10

Adding Context to Tableaux for DLs
Fu W; Peñaloza R (CEUR, 2012)We consider the problem of reasoning with ontologies where every axiom is associated to a context, and contexts are related through a total order. These contexts could represent, for example, a degree of trust associated ... 
Games for Query Inseparability of Description Logic Knowledge Bases
Botoeva E; Kontchakov R; Ryzhikov V; Wolter F; Zakharyaschev M (2016)We consider conjunctive query inseparability of description logic knowledge bases with respect to a given signature  a fundamental problem in knowledge base versioning, module extraction, forgetting and knowledge exchange. ... 
Gödel Negation Makes Unwitnessed Consistency Crisp
Borgwardt S; Distel F; Penaloza R (CEUR, 2012)Ontology consistency has been shown to be undecidable for a wide variety of fairly inexpressive fuzzy Description Logics (DLs). In particular, for any tnorm "starting with" the Lukasiewicz tnorm, consistency of crisp ... 
Logics of metric spaces
Kutz O; Wolter F; Sturm H; Suzuki N; Zakharyaschev M (2003)We investigate the expressive power and computational properties of two different types of languages intended for speaking about distances. First, we consider a firstorder language FM the twovariable fragment of which ... 
NonGödel Negation Makes Unwitnessed Consistency Undecidable
Borgwardt S; Peñaloza R (CEUR, 2012)Recent results show that ontology consistency is undecidable for a wide variety of fuzzy Description Logics (DLs). Most notably, undecidability arises for a family of inexpressive fuzzy DLs using only conjunction, existential ... 
On firstorder μcalculus over situation calculus action theories
Calvanese D; De Giacomo G; Montali M; Patrizi F (AAAI Press, 2016)In this paper we study verification of situation calculus action theories against firstorder mucalculus with quantification across situations. Specifically, we consider muLa and muLp, the two variants of mucalculus ... 
OntologyMediated Query Answering over Temporal Data: A Survey
Artale A; Kontchakov R; Kovtunova A; Ryzhikov R; Wolter F; Zakharyaschev M (Schloss Dagstuhl  LeibnizZentrum für Informatik GmbH, Dagstuhl Publishing, 2017)We discuss the use of various temporal knowledge representation formalisms for ontologymediated query answering over temporal data. In particular, we analyse ontology and query languages based on the linear temporal logic ... 
QueryBased Entailment and Inseparability for ALC Ontologies
Botoeva E; Lutz C; Ryzhikov V; Wolter F; Zakharyaschev M (AAAI Press, 2016)We investigate the problem whether two ALC knowledge bases are indistinguishable by queries over a given vocabulary. We give modeltheoretic criteria and prove that this problem is undecidable for conjunctive queries (CQs) ... 
Regular open APIs
Calvanese D; De Giacomo G; Lenzerini M; Vardi YM (AAAI Press, 2016)Open APIs are software intermediaries that make it possible for application programs to interact with data and processes, which can both be viewed as forms of services. In many scenarios, when one wants to obtain or publish ... 
Schema.org as a Description Logic
Hernich A; Lutz C; Ozaki A; Wolter F (AAAI Press, 2015)Schema.org is an initiative by the major search engine providers Bing, Google, Yahoo!, and Yandex that provides a collection of ontologies which webmasters can use to mark up their pages. Schema. org comes without a formal ...