An incremental algorithm for computing prime implicates in modal logic

DOI10.1007/978-3-319-06089-7_13zbMATH Open1405.68364OpenAlexW993196258MaRDI QIDQ5410643FDOQ5410643

Authors: Manoj K. Raut 

Publication date: 16 April 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06089-7_13

Recommendations

• Prime implicates and prime implicants: from propositional to modal logic
• scientific article; zbMATH DE number 1390353
• Computing prime implicates by pruning the search space and accelerating subsumption
• Computation of prime implicants using matrix and paths
• An efficient algorithm to generate prime implicants

zbMATH Keywords

modal logicknowledge compilationprime implicates

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27)

Cited In (3)

• Computing prime implicants via transversal clauses
• Title not available (Why is that?)
• Prime implicates and prime implicants: from propositional to modal logic

This page was built for publication: An incremental algorithm for computing prime implicates in modal logic

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