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.
Work partially supported by the ESPRIT II Basic Resarch Actions Program Project no. 7141 “ALCOM II”, and by the Italian MURST National Project “Algoritmi, Modelli di Calcolo e Strutture Informative”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ausiello, G., D'Atri, A., Sacca, D.: Minimal representation of directed hypergraphs. SIAM Journal on Computing 2 (1986) 418–431
Ausiello, G., Italiano, G.F.: On-line algorithms for polinomially solvable satisfiability problems. Journal of Logic Programming 10 (1991) 69–90
Ausiello, G., Italiano, G. F., Nanni, U.: Dynamic maintenance of directed hyper-graphs. Theoretical Computer Science 72 (1990) 97–117
Ausiello, G., Italiano, G. F., Nanni, U.: Optimal traversal of directed hypergraphs. ICSI Technical Report TR-92-073 (September 1992)
Bonissone, P. P., Decker, K. S.: Selecting uncertainty calculi and granularity: an experiment in trading-off precision and complexity. Proceedings of the Workshop on Uncertainty and Probability in Artificial Intelligence, University of California, Los Angeles, August 14–16 (1985) 57–66.
Buchanan, B. G., Shortliffe, E.H.: Rule-based expert systems. Addison-Wesley (1984)
McCarthy, J.: Circumscription — a form of non-monotonic reasoning. Artif. Intell. 13 (1980) 27–40
Cambini, R., Gallo, G., Scutella, M. G.: Minimum cost flows on hypergraphs. TR-1/92 Dipartimento di Informatica, Università di Pisa (1992)
McDermott, D., Doyle, J.: Nonmonotonic logic I. JACM 29 (1982) 33–57
McDermott, D.: Nonmonotonic logic II. Artif. Intell. 13 (1980) 41–72
Dubois, D., Prade, H.: Fuzzy sets and systems: theory and applications. Academic Press (1980)
Duda, R. O., Hart, P. E., Nilsson, N. J.: Subjective bayesian methods for rule-based inference systems. AFIPS Conference Proceedings, New York (1976) 1074–1982
Encyclopedia of artificial intelligence John Wiley & Sons, Inc. (1987)
Gallo, G., Longo, G., Nguyen, S., Pallottino, S.: Directed hypergraphs and applications. Discrete Applied Mathematics 42 (1993) 177–201
Garvey, T. D., Lovrance, J. D., Fishler, M. A.: An inference technique for integrating knowledge from disparate sources. Proceedings of the Seventh International Joint Conference on Artificial Intelligence, Vancouver, B.C. (1981) 319–325
Giaccio, R.: On-line algorithms for satisfiability formulae with uncertainty. TR-2/94 Dipartimento di Informatica e Sistemistica, Università degli studi di Roma “La Sapienza”.
Kifer, M., Li, A.: On the semantics of rule-based expert systems with uncertainty. International Conference on Database Theory 1988, LNCS vol. 326, Springer-Verlag (September 1988) 186–202
Pearl, J.: Reverend bayes on inference engine: a distributed hierarchical approach. Proceedings of the Second National Conference on Artificial Intelligence, Pittsburgh, PA (1982) 133–136
Pearl, J.: Probabilistic reasoning in intelligent systems: network of plausible inference. Morgan Kaufmann Publishers (1988)
Pretolani, D.: Satisfiability and hypergraphs. TD 12/93, Dipartimento di Informatica, Università di Pisa (1993)
Reiter, R.: A logic for default reasoning. Artif. Intell. 13 (1980) 81–132
Rollinger, C. R.: How to represent evidence: aspects of uncertainty reasoning. Proceedings of the Eighth International Joint Conference on Artificial Intelligence, Karlsruhe, FRG (1983) 358–361
Shafer, G.: A mathematical theory of evidence. Princeton University Press (1976)
Shortliffe, E. H., Buchanan, B. G.: A model of inexact reasoning in medicine. Math. Biosci. 23 (1975) 351–379
Zadeh, L. A.: Fuzzy sets. Inf. Ctrl. 8 (1965) 338–353
Zadeh, L. A.: Fuzzy sets as a basys for a theory of possibility. Fuzzy Sets Sys. 1 (1978) 3–28
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giaccio, R. (1995). On-line algorithms for satisfiability problems with uncertainty. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 1994. Lecture Notes in Computer Science, vol 903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59071-4_62
Download citation
DOI: https://doi.org/10.1007/3-540-59071-4_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59071-2
Online ISBN: 978-3-540-49183-5
eBook Packages: Springer Book Archive