2021/07/18 by Laura Giordano, Giordano, Laura, Alberto Martelli +3
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #I.2.4 #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation #Semantic Web and Ontologies
paper · pdf · doi:10.48550/arxiv.2107.08403
openalex publication_date 2021/07/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.