Reasoning with Forest Logic Programs Using Fully Enriched Automata

DOI10.1007/978-3-319-23264-5_29zbMath1467.68172OpenAlexW2284654286MaRDI QIDQ3449217

Cristina Feier, Thomas Eiter

Publication date: 4 November 2015

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23264-5_29

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in artificial intelligence (68T27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic programming (68N17)

Related Items (2)

Reasoning with Forest Logic Programs Using Fully Enriched Automata ⋮ CTL\(^\ast\) with graded path modalities

Cites Work

• Open answer set programming for the semantic web
• Reasoning with Forest Logic Programs Using Fully Enriched Automata
• The Complexity of Enriched Mu-Calculi
• Open answer set programming with guarded programs
• Reasoning with Forest Logic Programs and f-hybrid knowledge bases
• Foundations of Information and Knowledge Systems

This page was built for publication: Reasoning with Forest Logic Programs Using Fully Enriched Automata