paper-with-me

홈 › Papers

Expressivity of Planning with Horn Description Logic Ontologies (Technical Report)

2022-03-17 · Stefan Borgwardt, Jörg Hoffmann, Alisa Kovtunova, Markus Krötzsch, Bernhard Nebel, Marcel Steinmetz

State constraints in AI Planning globally restrict the legal environment states. Standard planning languages make closed-domain and closed-world assumptions. Here we address open-world state constraints formalized by planning over a description logic (DL) ontology. Previously, this combination of DL and planning has been investigated for the light-weight DL DL-Lite. Here we propose a novel compilation scheme into standard PDDL with derived predicates, which applies to more expressive DLs and is based on the rewritability of DL queries into Datalog with stratified negation. We also provide a new rewritability result for the DL Horn-ALCHOIQ, which allows us to apply our compilation scheme to quite expressive ontologies. In contrast, we show that in the slight extension Horn-SROIQ no such compilation is possible unless the weak exponential hierarchy collapses. Finally, we show that our approach can outperform previous work on existing benchmarks for planning with DL ontologies, and is feasible on new benchmarks taking advantage of more expressive ontologies. That is an extended version of a paper accepted at AAAI 22.

📄 PDF Abstract BibTeX arXiv:2203.09361

Code (1)

https://zenodo.org/record/8139150 공식 구현

Tasks

Negation

Similar Papers 제목 키워드 기반

Planning with OWL-DL Ontologies (Extended Version)

2024-08-14 · Tobias John, Patrick Koopmann

We introduce ontology-mediated planning, in which planning problems are combined with an ontology. Our formalism differs from existing ones in that we focus on a strong separation of the formalisms for describing plannin…

Computing Horn Rewritings of Description Logics Ontologies

2015-04-20 · Mark Kaminski, Bernardo Cuenca Grau

We study the problem of rewriting an ontology O1 expressed in a DL L1 into an ontology O2 in a Horn DL L2 such that O1 and O2 are equisatisfiable when extended with an arbitrary dataset. Ontologies that admit such rewrit…

A Practical Acyclicity Notion for Query Answering over Horn-SRIQ Ontologies

2018-04-19 · David Carral, Cristina Feier, Pascal Hitzler

Conjunctive query answering over expressive Horn Description Logic ontologies is a relevant and challenging problem which, in some cases, can be addressed by application of the chase algorithm. In this paper, we define a…

First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics

2020-11-19 · Meghyn Bienvenu, Peter Hansen, Carsten Lutz, Frank Wolter

We study FO-rewritability of conjunctive queries in the presence of ontologies formulated in a description logic between EL and Horn-SHIF, along with related query containment problems. Apart from providing characterizat…

A Horn extension of DL-Lite with NL data complexity

2026-05-13 · Janos Arpasi, Bartosz Jan Bednarczyk, Magdalena Ortiz arxiv

The literature on ontology-mediated query answering (OMQA) has been shaped by two key results: first-order rewritability for DL-Lite, and PTime-hardness of data complexity for essentially every description logic beyond i…