A combinatorial algorithm for Horn programs

DOI10.1007/978-3-642-10631-6_112MaRDI QIDQ3652297zbMATH OpenOpenAlexFDO

Authors R. Chandrasekaran, K. Subramani

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_112

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Analysis of algorithms (68W40) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A combinatorial algorithm for Horn programs
• A new algorithm for linear and integer feasibility in Horn constraints
• Feasibility checking in Horn constraint systems through a reduction based approach
• On a generalization of Horn constraint systems
• Linear-time algorithms for testing the satisfiability of propositional horn formulae

Cited in

(10)

• An efficient algorithm for Horn description
• Analyzing fractional Horn constraint systems
• Feasibility checking in Horn constraint systems through a reduction based approach
• A combinatorial algorithm for Horn programs
• A new algorithm for linear and integer feasibility in Horn constraints
• Smallest horn clause programs
• Combinatorial Problems for Horn Clauses
• Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
• An algorithm to compute maximal contractions for Horn clauses
• Trichotomy for integer linear systems based on their sign patterns

Describes a project that uses

Uses Software

• Yices

This page was built for publication: A combinatorial algorithm for Horn programs

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