A High-Level Petri Net for Goal-Directed Semantics of Horn Clause Logic.
John Jeffrey, Jorge Lobo, Tadao Murata:
A High-Level Petri Net for Goal-Directed Semantics of Horn Clause Logic.
IEEE Trans. Knowl. Data Eng. 8(2): 241-259(1996)@article{DBLP:journals/tkde/JeffreyLM96,
author = {John Jeffrey and
Jorge Lobo and
Tadao Murata},
title = {A High-Level Petri Net for Goal-Directed Semantics of Horn Clause
Logic},
journal = {IEEE Trans. Knowl. Data Eng.},
volume = {8},
number = {2},
year = {1996},
pages = {241-259},
ee = {db/journals/tkde/JeffreyLM96.html, db/journals/tkde/JeffreyLM96.html},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
Copyright © 1996 by The Institute of
Electrical and Electronic Engineers, Inc. (IEEE).
Abstract used with permission.
CDROM Edition
under construction (file=TKDE8/k0241.pdf)
References
- [1]
- Jonas Barklund, Nils Hagner, Malik Wafin:
Condition Graphs.
ICLP/SLP 1988: 435-446

- [2]
- ...
- [3]
- T. Y. Chen, Jean-Louis Lassez, Graeme S. Port:
Maximal Unifiable Subsets and Minimal Nonunifiable Subsets.
New Generation Comput. 4(2): 133-152(1986)

- [4]
- ...
- [5]
- Saumya K. Debray:
Static Inference of Modes and Data Dependencies in Logic Programs.
ACM Trans. Program. Lang. Syst. 11(3): 418-450(1989)

- [6]
- ...
- [7]
- ...
- [8]
- Jean H. Gallier:
Logic for Computer Science: Foundations of Automatic Theorem Proving.
Harper & Row 1986, ISBN 0-06-042225-4

- [9]
- Jean H. Gallier, Stan Raatz:
Logic Programming and Graph Rewriting.
SLP 1985: 208-219

- [10]
- ...
- [11]
- ...
- [12]
- ...
- [13]
- ...
- [14]
- ...
- [15]
- ...
- [16]
- Robert A. Kowalski:
A Proof Procedure Using Connection Graphs.
J. ACM 22(4): 572-595(1975)

- [17]
- Robert A. Kowalski:
Algorithm = Logic + Control.
Commun. ACM 22(7): 424-436(1979)

- [18]
- John W. Lloyd:
Foundations of Logic Programming, 2nd Edition.
Springer 1987, ISBN 3-540-18199-7

- [19]
- ...
- [20]
- ...
- [21]
- Tadao Murata, V. S. Subrahmanian, Toshiro Wakayama:
A Petri Net Model for Reasoning in the Presence of Inconsistency.
IEEE Trans. Knowl. Data Eng. 3(3): 281-292(1991)

- [22]
- Tadao Murata, Du Zhang:
A Predicate-Transition Net Model for Parallel Interpretation of Logic Programs.
IEEE Trans. Software Eng. 14(4): 481-497(1988)

- [23]
- ...
- [24]
- R. Ramesh, I. V. Ramakrishnan, David Scott Warren:
Automata-Driven Indexing of Prolog Clauses.
POPL 1990: 281-291

- [25]
- Ehud Y. Shapiro:
The Family of Concurrent Logic Programming Languages.
ACM Comput. Surv. 21(3): 413-510(1989)

- [26]
- Hisao Tamaki, Taisuke Sato:
OLD Resolution with Tabulation.
ICLP 1986: 84-98

- [27]
- ...
- [28]
- Maarten H. van Emden:
An Algorithm for Interpreting Prolog Programs.
ICLP 1982: 56-64

- [29]
- Laurent Vieille:
A Database-Complete Proof Procedure Based on SLD-Resolution.
ICLP 1987: 74-103

- [30]
- ...
Copyright © Tue Dec 8 20:31:36 2009
by Michael Ley (ley@uni-trier.de)