Disjunction in modal description logics

DOI10.2298/PIM0796025MMaRDI QIDQ3510439zbMATH OpenOpenAlexFDO

Authors Milenko Mosurovic

Publication date 2 July 2008

Published in Publications de l'Institut Math?matique (Belgrade) (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/130039

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

complexity of satisfiabilitysimulation of disjunction

Mathematics Subject Classification ID

Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in artificial intelligence (68T27)

Recommendations

• Disjunctive logic and semantics of disjunctive logic programs
• scientific article; zbMATH DE number 4200183
• Reasoning in basic description logics and description logics with modal operators
• Disjunctive bases: normal forms for modal logics
• Disjunctive bases: normal forms and model theory for modal logics
• Completeness of relevant modal logics with disjunctive rules
• Disjunctive form and the modal alternation hierarchy
• Disjunction and existence properties in inquisitive first-order logic
• On the complexity of the disjunction property in intuitionistic and modal logics
• Reasoning in description logics by a reduction to disjunctive datalog

Cited in

(4)

• An alternative rule of disjunction in modal logic
• DiMo -- discrete modelling using propositional logic
• scientific article; zbMATH DE number 500947 (Why is no real title available?)
• Consequence-Based Reasoning for Description Logics with Disjunctions and Number Restrictions

This page was built for publication: Disjunction in modal description logics

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