Abstract
A complex reasoning system can be designed as an interaction between reasoning modules. A module consists of a declaration of exported/imported predicates and a set of rules containing both negation by default and classical negation. A prioritized modular logic program (PMP) consists of a set of modules and a partial order <def on the predicate definitions (M, p), where M is a module and p is a predicate exported by M. Because of the classical negation, conflicts may arise within and among modules. The partial order <def denotes the relative reliability of the predicate definitions contributing to the conflict. We present the reliable semantics for PMPs. The goal of the reliable semantics is to draw reliable conclusions from possibly contradictory PMPs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Bossi, M. Gabbrielli, G. Levi, M.C. Meo, “Contributions to the Semantics of Open Logic Programs”, Proc. of the Intern. Conference of Fifth Generation Computer Systems (FGCS'92), 1992, pp. 570–580.
S. Brass, U.W. Lipeck, “Semantics of Inheritance in Logical Object Specifications”, 2nd Intern. Conf. on Deductive and Object-Oriented Databases, 1991.
P.M. Dung, “An Argumentation Semantics for Logic Programs with Explicit Negation”, 10th Intern. Conf. on Logic programming (ICLP'93), 1993, pp.616–630.
D. Gabbay, E. Laenens, D. Vermeir, “Credulous vs. Sceptical Semantics for Ordered Logic Programs”, Proc. of the 2nd International Conference on Knowledge Representation and Reasoning (KR'91), 1991, pp. 208–217.
M. Gelfond, V. Lifschitz, “The Stable Model Semantics for Logic Programming”, Proc. of the 5th Symposium on Logic Programming, 1988.
E. Laenens, D. Vermeir, “Assumption-free Semantics for Ordered Logic Programs: On the Relationship Between Well-founded and Stable Partial Models”, Journal of Logic and Computation, 2(2), 1992, pp. 133–172.
L.M. Pereira, J.J. Alferes, “Well-founded Semantics for Logic Programs with Explicit Negation”, 10th European Conf. on Artificial Intelligence, 1992, pp. 92–96.
L.M. Pereira, J.N. Aparicio, J.J. Alferes, “Nonmonotonic Reasoning with Logic Programming”, Journal of Logic Programming, 17, 1993, pp. 227–263.
T. Przymusinski, “Well-Founded Semantics Coincides with the Three-Valued Stable Semantics”, Fundamenta Informaticae XIII, 1990, pp. 445–463.
V.S. Subrahmanian, “Amalgamating Knowledge Bases”, to be published in ACM Transactions on Database Systems (TODS), 1994.
A. van Gelder, K.A. Ross, J.S. Schlipf, “The Weil-Founded Semantics for General Logic Programs”, Journal of the ACM, 38(3), July 1991, pp.620–650.
C. Witteveen, “Expanding Logic Programs”, D. Pearce and G. Wagner (eds). Logics in AI, LNCS 633, 1992, pp. 372–390.
G. Wagner, “Reasoning with Inconsistency in Extended Deductive Databases”, Proc. of the 2nd Intern. Workshop on Logic Programming and Non-monotonic Reasoning, 1993, pp.300–315.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Analyti, A., Pramanik, S. (1994). Declarative semantics for contradictory modular logic programs. In: Raś, Z.W., Zemankova, M. (eds) Methodologies for Intelligent Systems. ISMIS 1994. Lecture Notes in Computer Science, vol 869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58495-1_25
Download citation
DOI: https://doi.org/10.1007/3-540-58495-1_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58495-7
Online ISBN: 978-3-540-49010-4
eBook Packages: Springer Book Archive