Automata-Based Axiom Pinpointing
From MaRDI portal
Recommendations
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- An overview of tableau algorithms for description logics
- Attributive concept descriptions with complements
- Automata can show PSpace results for description logics
- Automata-Based Axiom Pinpointing
- Automata-theoretic techniques for modal logics of programs
- Axiom Pinpointing in General Tableaux
- Finite tree automata with cost functions
- General lattice theory. New appendices with B. A. Davey, R. Freese, B. Ganter, M. Greferath, P. Jipsen, H. A. Priestley, H. Rose, E. T. Schmidt, S. E. Schmidt, F. Wehrung, R. Wille.
- scientific article; zbMATH DE number 67500 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- RACER system description
- The inverse method implements the automata approach for modal satisfiability
- Weighted Automata and Weighted Logics on Infinite Words
Cited in
(8)
This page was built for publication: Automata-Based Axiom Pinpointing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541704)