An Automata View to Goal-Directed Methods

DOI10.1007/978-3-319-53733-7_7zbMath1485.68144OpenAlexW2588946677MaRDI QIDQ5738990

Lisa Hutschenreiter, Rafael Peñaloza

Publication date: 1 June 2017

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10281/258639

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in artificial intelligence (68T27)

Uses Software

• LTL2BA
• ELK

Cites Work

• Unnamed Item
• Fast, flexible MUS enumeration
• Automata-based axiom pinpointing
• Fast congruence closure and extensions
• Automata can show PSpace results for description logics
• Investigations on autark assignments
• The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
• Weighted automata and weighted logics
• A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics
• Towards efficient MUS extraction
• Axiom Pinpointing in General Tableaux
• Using Sums-of-Products for Non-standard Reasoning
• A Computing Procedure for Quantification Theory
• Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel