Tree-like unit refutations in Horn constraint systems

DOI10.1007/978-3-030-68195-1_18MaRDI QIDQ2232285zbMATH OpenOpenAlexFDO

Authors K. Subramani, Piotr Wojciechowski

Publication date 4 October 2021

Full work available at URL https://doi.org/10.1007/978-3-030-68195-1_18

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A combinatorial algorithm for Horn programs
• A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
• Automated Reasoning
• scientific article; zbMATH DE number 3733262 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 2090312 (Why is no real title available?)
• Kernelization. Theory of parameterized preprocessing
• Linear and unit-resulting refutations for Horn theories
• Optimal length resolution refutations of difference constraint systems
• Refutation search for Horn sets by a subgoal-extraction method
• Some consequences of non-uniform conditions on uniform classes
• Tree-like unit refutations in Horn constraint systems

Cited in

(6)

• VDM specification for the tree-modification method of refutation
• Tree-like unit refutations in Horn constraint systems
• On a generalization of Horn constraint systems
• Strategy of searching of a conclusion in Horn clauses with unitary consideration of sub-target
• On the computational and approximation complexities of selected unit refutations in UTVPI constraint systems
• Unit refutability of Horn constraint systems -- certification and parallel complexity

This page was built for publication: Tree-like unit refutations in Horn constraint systems

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