Disjunction in modal description logics

DOI10.2298/PIM0796025MzbMATH Open1164.03006OpenAlexW2033557509MaRDI QIDQ3510439

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

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 artificial intelligence (68T27) 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)

Related Items (4)

Consequence-Based Reasoning for Description Logics with Disjunctions and Number Restrictions ⋮ An alternative rule of disjunction in modal logic ⋮ Title not available (Why is that?) ⋮ DiMo -- discrete modelling using propositional logic

Recommendations

• Disjunctive logic and semantics of disjunctive logic programs 👍 👎
• Disjunction and existence properties in inquisitive first-order logic 👍 👎
• Reasoning in description logics by a reduction to disjunctive datalog 👍 👎
• On the complexity of the disjunction property in intuitionistic and modal logics 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)