scientific article; zbMATH DE number 1765664

MaRDI QIDQ4539600zbMATH OpenFDO

Authors Franz Baader, Stephan Tobies

Publication date 10 July 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2083/20830092

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Modal logic (including the logic of norms) (03B45)

Recommendations

• Implementing tableau calculi using BDDs: BDDTab system description
• Modal Satisfiability via SMT Solving
• The inverse method
• Theory and Applications of Relational Structures as Knowledge Instruments
• TABLEAUX: A general theorem prover for modal logics

Cited in

(8)

• The complexity of computing the behaviour of lattice automata on infinite trees
• Approximate unification in the description logic \(\mathcal {FL}_0\)
• One-Pass Tableaux for Computation Tree Logic
• Automata-Based Axiom Pinpointing
• Description Logics
• Approximation in description logics: how weighted tree automata can help to define the required concept comparison measures in \(\mathcal {FL}_0\)
• Automata-based axiom pinpointing
• Automata can show PSpace results for description logics

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4539600)