An extended Petri net is used to model function-free logic programs with negation, i.e., normal logic programs. In this model, because of the presence of inhibitor arcs, the arbitrary applications of firing rules may ...
详细信息
ISBN:
(纸本)0818628308
An extended Petri net is used to model function-free logic programs with negation, i.e., normal logic programs. In this model, because of the presence of inhibitor arcs, the arbitrary applications of firing rules may cause a contradictory situation. We suggest two directions to avoid contradictions, greedy and secure applications of firing rules. We choose secure application in this paper and show that this is a direct translation of the well-founded semantics in the net model. Furthermore, we show that an unfounded set corresponds to a siphon in Petri net theory when we delete the transitions disabled by the secure application of firing rules, and that the property of siphons simplifies the computation of well-founded semantics for logic programs.
This report discusses the definition and implementation of constraint operations for CLP(FT), Prolog with universally quantified disequality constraints on finite trees. As a follow-up to [SH90], where we defined seve...
详细信息
This report discusses the definition and implementation of constraint operations for CLP(FT), Prolog with universally quantified disequality constraints on finite trees. As a follow-up to [SH90], where we defined several operations needed for the partial evaluation of CLP(FT), this report presents: a concise syntax for U-constraints, universally quantified disequality constraints;algorithms for the projection, equivalence, and semantic difference operations needed in the partial evaluation algorithm;a solved form for U-constraints, based on a solved form for existentially quantified equations, that allows the projection of a set of constraints onto a set of variables to be easily computed. The projection of a solved form set C of constraints onto a set V of variables is equal to those constraints c in C whose free variables are all contained in V;and a canonical form for sets of U-constraints that allows the equivalence operation to be easily computed. We also discuss applications of U-constraints and relation to previous work.
A complete implementation of the negation as failure rule in a logic programming system requires that only ground negative literals are selected during the evaluation. Obviously there is the possibility to have only n...
详细信息
We suggest a method for justifying why a literal is or is notcontained in the answer set of a logic program. This methodmakes use of argumentation theory, more precisely of stableASPIC+ extensions. We describe a way t...
详细信息
In this paper, we overview our recent research activity concerning the induction of logic programming specifications, and the proof of their properties via Abductive logic programming. Both the inductive and abductive...
详细信息
In this paper, we overview our recent research activity concerning the induction of logic programming specifications, and the proof of their properties via Abductive logic programming. Both the inductive and abductive tool here briefly described have been applied to respectively learn and verify (properties of) interaction protocols in multiagent systems, Web service choreographies, careflows and business processes.
Despite the emergence of probabilistic logic programming (PLP) languages for data driven applications, there are currently no debugging tools based on provenance for PLP programs. In this paper, we propose a novel pro...
详细信息
Abstract interpretation is a general methodology for building static analyses which are useful for program optimization and verification. Finite domain symbolic constraints constitute a restricted class of first order...
详细信息
"Super Monaco" is the successor to Monaco, a shared-memory multiprocessor implementation of a flat concurrent logic programming language. While the system retains, by-and-large, the older Monaco compiler and...
详细信息
In this paper we continue the work on our extension of Answer Set programming by non-Herbrand functions and add to the language support for arithmetic expressions and various inequality relations over non-Herbrand fun...
详细信息
作者：
Wotawa, Franz
Institute of Software Technology Inffeldgasse 16b/2 GrazA-8010 Austria
Allocating tasks to computing nodes in a network is an important configuration problem. In the case of fail-safe networks, such configuration must be changed during operation if a computing node fails. Hence, a fast c...
详细信息
暂无评论