Determining the <I>SHOIN(D)</I>-Satisfiability with a Complete Disjunctive Normal Form Group

DOI10.3724/SP.J.1001.2010.03597MaRDI QIDQ3014301zbMATH OpenOpenAlexFDO

Authors

Publication date 19 July 2011

Published in Journal of Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/sp.j.1001.2010.03597

zbMATH Keywords

disjunctive normal formreasoning in description logicsatisfiability

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). II
• Satisfiability problem: Some polynomial classes of conjunctive normal forms
• Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I
• scientific article; zbMATH DE number 3855056
• On the sensitivity conjecture for disjunctive normal forms
• Stretching Groth-Sahai: NIZK proofs of partial satisfiability
• scientific article; zbMATH DE number 1775445
• scientific article; zbMATH DE number 746893
• The properties of determinative disjunctive normal forms and systems based on them

This page was built for publication: Determining the <I>SHOIN(D)</I>-Satisfiability with a Complete Disjunctive Normal Form Group

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