Reasoning about actions with EL ontologies with temporal answer sets
Giordano, Laura, Martelli, Alberto, Dupré, Daniele Theseider
–arXiv.org Artificial Intelligence
We propose an approach based on Answer Set Programming for reasoning about actions with domain descriptions including ontological knowledge, expressed in the lightweight description logic EL^\bot. We consider a temporal action theory, which allows for non-deterministic actions and causal rules to deal with ramifications, and whose extensions are defined by temporal answer sets. We provide conditions under which action consistency can be guaranteed with respect to an ontology, by a polynomial encoding of an action theory extended with an EL^\bot knowledge base (in normal form) into a temporal action theory.
arXiv.org Artificial Intelligence
Jul-18-2021
- Country:
- North America
- United States > Pennsylvania
- Philadelphia County > Philadelphia (0.04)
- Canada > Quebec
- Montreal (0.04)
- United States > Pennsylvania
- Europe
- United Kingdom
- Scotland > City of Edinburgh
- Edinburgh (0.04)
- England > Merseyside
- Liverpool (0.04)
- Scotland > City of Edinburgh
- Italy
- United Kingdom
- Asia > Middle East
- Republic of Türkiye (0.04)
- North America
- Genre:
- Research Report (0.40)
- Technology: