Maximal unifiable subsets and minimal non-unifiable subsets
New Generation Computing
Parallel execution of logic programs
Parallel execution of logic programs
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
A Predicate-Transition Net Model for Parallel Interpretation of Logic Programs
IEEE Transactions on Software Engineering
Static inference of modes and data dependencies in logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The family of concurrent logic programming languages
ACM Computing Surveys (CSUR)
Automata-driven indexing of Prolog clauses
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
High-level Petri net semantics of concurrent and non-concurrent logic programs
High-level Petri net semantics of concurrent and non-concurrent logic programs
A Proof Procedure Using Connection Graphs
Journal of the ACM (JACM)
Communications of the ACM
Graph-Based Proof Procedures for Horn Clauses
Graph-Based Proof Procedures for Horn Clauses
A Petri Net Model for Reasoning in the Presence of Inconsistency
IEEE Transactions on Knowledge and Data Engineering
OLD Resolution with Tabulation
Proceedings of the Third International Conference on Logic Programming
Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part I
Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part I
Fuzzy Rule Base Systems Verification Using High-Level Petri Nets
IEEE Transactions on Knowledge and Data Engineering
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks
On computation complexity of the concurrently enabled transition set problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Expert Systems with Applications: An International Journal
Design of a high speed logic engine for distributed decision support systems
Intelligent Decision Technologies
| Hi-index | 0.01 |
A new high-level Petri net (HLPN) model is introduced as a graphical syntax for Horn Clause Logic (HCL) programs. We call these nets: Horn Clause Logic Goal-Directed Nets (HCLGNs). It is shown that there is a bijection between the queried definite programs and the class of HCLGNs. In addition, a visualization of SLD-resolution is realized through the enabling and firing rules and net markings. The correctness of these rules with respect to SLD-resolution is also proven. Using these notions, we model SLD-refutations and failing computations.Through minor modification of the definition of HCLGNs for pure HCL programs and of the enabling and firing rules, it is shown how HCLGNs can be used to model built-in atoms and provide a new AND/OR-parallel execution model. HCLGNs have also been used to: model a subset of Prolog; provide a framework for modeling variations on SLD-resolution, such as SLD-ALG; specify an operational semantics for committed-choice (flat-guarded) concurrent logic languages using FGHC as an example.Recently, several software packages have become available for editing and executing HLPNs. These graphical editors can now play the same role that string editors have played for many years. The simulation capabilities of the HLPN software offer opportunities to perform automated, interactive code walk-throughs and also have potential for providing a framework for visual debugging environments. We note however that HCLGNs differ from the major classes of HLPNs for which software tools have been developed in primarily two ways: 1) the tokens in the markings can have variables; and 2) the firing of a transition may not only update the marking of the adjacent places, but may instantiate variables in tokens in the markings of places that are non-adjacent to the fired transition. Thus, the existing packages can only provide graphical syntax editing and are not appropriate for graphical simulation of HCLGNs. In the paper, we provide an algebraic characterization of HCLGNs that can serve as a design guideline for implementing HCLGNs.