Abstract
In this paper the problem of the on-line satisfiability of a Horn formula with uncertainty is addressed; we show how to represent a significant class of formulae by weighted directed hypergraphs and we present two algorithms that solve the on-line SAT problem and find a minimal interpretation for the formula working on the dynamic hypergraph representation. These algorithms make increasing assumptions on the formula and we will find that the second one solves the on-line SAT problem with a total time linear in the size of the formula, matching the optimal result for boolean Horn formulae.
Cite
CITATION STYLE
Giaccio, R. (1995). On-line algorithms for satisfiability problems with uncertainty. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 903, pp. 371–386). Springer Verlag. https://doi.org/10.1007/3-540-59071-4_62
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
