This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C.-L. Chang and R.C.-T. Lee, Symbolic logic and mechanical theorem proving (Academic Press, London, 1973).
D.P. Friedman and D.S. Wise, CONS should not evaluate its arguments, in: S. Michaelson and R. Milner, eds., Automata, Languages and Programming, (Edinburgh University Press), 257–284.
S. Gregory, Parallel Logic Programming in PARLOG (Addison-Wesley, 1987).
P. Henderson and J.H. Morris, A lazy evaluator, in: Proceedings of the 3rd ACM Symposium on Principles of Programming Languages, 1976, ACM, 95–103.
Ph. Jorrand, Design and implementation of a parallel inference machine for first order logic, in: Proc. PARLE Conference (Lecture Notes in Computer Science No. 259, Springer-Verlag, 1987).
J.W. Lloyd, Foundations of Logic Programming (Springer-Verlag, 1984).
Z. Markov, A framework for network modeling in Prolog, in: Proceedings of IJCAI-89, Detroit, U.S.A (1989), 78–83.
Z. Markov and Th. Risse. Prolog Based Graph Representation of Polyhedra, in: Proceedings of AIMSA'88 (Artificial Intelligence III, North-Holland, 1988), 187–194.
Z. Markov and Ch. Dichev, Logical inference in a network environment, in: Proceedings of AIMSA'90 (Artificial Intelligence IV, North-Holland, 1990), 169–178.
Z. Markov, C. Dichev and L. Sinapova, The Net-Clause Language — a tool for describing network models, in: Proceedings of the Eighth Canadian Conference on AI, Ottawa, Canada, 23–25 May, 1990, 33–39.
Z. Markov, L. Sinapova and Ch. Dichev. Default reasoning in a network environment, in: Proceedings of ECAI-90, Stockholm, Sweden, August 6–10, 1990, pp.431–436.
N.V. Murray, Completely non-clausal theorem proving, Artificial intelligence 18 (1982), 67–85.
L. Naish, ed., MU-Prolog 3.1db Reference Manual. Dept. of Computer Science, University of Melbourne, 1984.
R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980), 81–132.
E. Shapiro, Concurrent PROLOG: A Progress Report, in: Lecture Notes in Computer Science No. 232 (Springer-Verlag, 1986), 277–313.
L. Sinapova, A network parsing scheme, in: Proceedings of AIMSA'90 (Artificial Intelligence IV, North-Holland, 1990), 383–392.
E.M. Stickel, An Introduction to Automated Deduction, in: W. Bibel, Jorrand, eds., Fundamentals of Artificial Intelligence. An advanced Course (Springer-Verlag, 1986).
K. Ueda, Guarded Horn Clauses, ICOT Technical Report TR-103, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Markov, Z., Dichev, C. (1991). The net-clause language — A tool for data-driven inference. In: van Eijck, J. (eds) Logics in AI. JELIA 1990. Lecture Notes in Computer Science, vol 478. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018453
Download citation
DOI: https://doi.org/10.1007/BFb0018453
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53686-4
Online ISBN: 978-3-540-46982-7
eBook Packages: Springer Book Archive