Refutation search for Horn sets by a subgoal-extraction method

DOI10.1016/0743-1066(90)90043-5zbMath0705.68089OpenAlexW2023509229MaRDI QIDQ3485884

No author found.

Publication date: 1990

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(90)90043-5

zbMATH Keywords

logic programmingautomated theorem provingHorn setsrefutation searchdeductive-databases management

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items (3)

Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction ⋮ The anatomy of vampire. Implementing bottom-up procedures with code trees ⋮ Tree-like unit refutations in Horn constraint systems

This page was built for publication: Refutation search for Horn sets by a subgoal-extraction method