Results 1 - 10 of 77,081

The Well-Founded Semantics for General Logic Programs

by Kenneth A. Ross - Journal of the ACM , 1991
"... ..."
Abstract - Cited by 997 (15 self) - Add to MetaCart
Abstract not found

Tabled Evaluation with Delaying for General Logic Programs

by Weidong Chen, David S. Warren , 1996
"... SLD resolution with negation as finite failure (SLDNF) reflects the procedural interpretation of predicate calculus as a programming language and forms the computational basis for Prolog systems. Despite its advantages for stack-based memory management, SLDNF is often not appropriate for query evalu ..."
Abstract - Cited by 304 (29 self) - Add to MetaCart
evaluation of general logic programs by presenting tabled evaluation with delaying (SLG resolution).

Approximating General Logic Programs

by Chitta Baral, Michael Gelfond, Olga Kosheleva - Proc. ILPS , 1993
"... Consider an informal specification S 1 containing the closed world assumption (CWA) for its domain of discourse, the specification S 2 obtained from S 1 by removing CWA, a general logic program \Pi formalizing S 1 , and an extended logic program T formalizing S 2 . We will say that T is an approxi ..."
Abstract - Cited by 6 (5 self) - Add to MetaCart
Consider an informal specification S 1 containing the closed world assumption (CWA) for its domain of discourse, the specification S 2 obtained from S 1 by removing CWA, a general logic program \Pi formalizing S 1 , and an extended logic program T formalizing S 2 . We will say

Cautious Models for General Logic Programs

by Tomi Janhunen - IN PROCEEDINGS OF THE THIRD INTERNATIONAL WORKSHOP ON DEDUCTIVE DATABASES AND LOGIC PROGRAMMING , 1995
"... In this paper, cautious models of general logic programs are investigated. Such models are constructed iteratively using a monotonic operator which performs case analysis on total interpretations generated by enumerations of atoms. Consequently, every general logic program has a unique cautious mode ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
In this paper, cautious models of general logic programs are investigated. Such models are constructed iteratively using a monotonic operator which performs case analysis on total interpretations generated by enumerations of atoms. Consequently, every general logic program has a unique cautious

Proving termination of general logic programs

by Elena Marchiori - Journal of Arti Intelligence Research , 1996
"... This paper introduces a methodology for proving termination of general logic programs, when the Prolog selection rule is considered. This methodology combines the approaches by Apt and Bezem [l] and Apt and Pedreschi [2], and provides a simple and flexible tool for proving termination. 1 ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
This paper introduces a methodology for proving termination of general logic programs, when the Prolog selection rule is considered. This methodology combines the approaches by Apt and Bezem [l] and Apt and Pedreschi [2], and provides a simple and flexible tool for proving termination. 1

Programming by Combining General Logic Programs

by A. Brogi, S. Contiero, F. Turini - Journal of logic and computation , 1997
"... The program composition approach can be fruitfully applied to combine general logic programs, that is, logic programs possibly containing negative premises. We show how the introduction of a basic set of (meta-level) composition operations over general programs increases the knowledge representation ..."
Abstract - Cited by 15 (2 self) - Add to MetaCart
The program composition approach can be fruitfully applied to combine general logic programs, that is, logic programs possibly containing negative premises. We show how the introduction of a basic set of (meta-level) composition operations over general programs increases the knowledge

Termination Prediction for General Logic Programs

by Yi-dong Shen, Danny De Schreye, Dean Voets , 2009
"... We present an approximation framework for attacking the undecidable termination problem of logic programs, as an alternative to current termination/non-termination proof approaches. We introduce an idea of termination prediction, which predicts termination of a logic program in case that neither a t ..."
Abstract - Add to MetaCart
termination nor a nontermination proof is applicable. We establish a necessary and sufficient characterization of infinite (generalized) SLDNF-derivations with arbitrary (concrete or moded) queries, and develop an algorithm that predicts termination of general logic programs with arbitrary queries. We have

Compiling Defeasible Inheritance Networks to General Logic Programs

by Jia-huai You, Xianchang Wang, Li Yan Yuan - Artificial Intelligence , 1999
"... We present a method of compiling arbitrary defeasible (inheritance) networks to general logic programs. We show a one-to-one correspondence between the credulous extensions of a defeasible network and the stable models of the translated logic program. This result leads to the discovery that an elega ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
We present a method of compiling arbitrary defeasible (inheritance) networks to general logic programs. We show a one-to-one correspondence between the credulous extensions of a defeasible network and the stable models of the translated logic program. This result leads to the discovery

Practical methods for proving termination of general logic programs

by Elena Marchiori - Journal of Artificial Intelligence Research , 1996
"... Termination of logic programs with negated body atoms (here called general logic programs) is an important topic. One reason is that many computational mechanisms used to process negated atoms, like Clark's negation as failure and Chan's constructive negation, are based on termination cond ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
Termination of logic programs with negated body atoms (here called general logic programs) is an important topic. One reason is that many computational mechanisms used to process negated atoms, like Clark's negation as failure and Chan's constructive negation, are based on termination

Compiling Defeasible Inheritance Networks to General Logic Programs

by Jia-Huai You Xianchang, Jia-huai You, Xianchang Wang, Li Yan Yuan - Artificial Intelligence , 1999
"... We present a method of compiling arbitrary defeasible (inheritance) networks to general logic programs. We show a one-to-one correspondence between the credulous extensions of a defeasible network and the stable models of the translated logic program. This result leads to the discovery that an elega ..."
Abstract - Add to MetaCart
We present a method of compiling arbitrary defeasible (inheritance) networks to general logic programs. We show a one-to-one correspondence between the credulous extensions of a defeasible network and the stable models of the translated logic program. This result leads to the discovery
Results 1 - 10 of 77,081