Constructive Negation in Logic Programs

1987 ◽  
Author(s):  
Richard Hamlet
Keyword(s):  
Logic Programs ◽  
Constructive Negation

scholarly journals Practical Methods for Proving Termination of General Logic Programs

1996 ◽  
Vol 4 ◽  
pp. 179-208 ◽  
Author(s):  
E. Marchiori
Keyword(s):  
Selection Rule ◽  
Logic Programs ◽  
Negation As Failure ◽  
General Logic ◽  
Constructive Negation

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 conditions. This paper introduces a methodology for proving termination of general logic programs w.r.t. the Prolog selection rule. The idea is to distinguish parts of the program depending on whether or not their termination depends on the selection rule. To this end, the notions of low-, weakly up-, and up-acceptable program are introduced. We use these notions to develop a methodology for proving termination of general logic programs, and show how interesting problems in non-monotonic reasoning can be formalized and implemented by means of terminating general logic programs.

Generalized Disjunctive Well-Founded Semantics for Logic Programs

1990 ◽  
Author(s):  
Chitta Baral ◽  
Jorge Lobo ◽  
Jack Minker
Keyword(s):  
Logic Programs

Logical Decision Problems and Complexity of Logic Programs

1987 ◽  
Vol 10 (1) ◽  
pp. 1-33
Author(s):  
Egon Börger ◽  
Ulrich Löwen
Keyword(s):  
Fixed Point ◽  
Computational Complexity ◽  
Decision Problem ◽  
Decision Problems ◽  
Complexity Classes ◽  
Logic Programs ◽  
Finite Structures ◽  
Syntactic Restrictions

We survey and give new results on logical characterizations of complexity classes in terms of the computational complexity of decision problems of various classes of logical formulas. There are two main approaches to obtain such results: The first approach yields logical descriptions of complexity classes by semantic restrictions (to e.g. finite structures) together with syntactic enrichment of logic by new expressive means (like e.g. fixed point operators). The second approach characterizes complexity classes by (the decision problem of) classes of formulas determined by purely syntactic restrictions on the formation of formulas.

Y-Logic: A Framework for Reasoning About Chameleonic Programs with Inconsistent Completions

1990 ◽  
Vol 13 (4) ◽  
pp. 465-483
Author(s):  
V.S. Subrahmanian
Keyword(s):  
Classical Logic ◽  
Logic Program ◽  
Logic Programs ◽  
Large Subset ◽  
General Logic ◽  
Traditional Sense

Large logic programs are normally designed by teams of individuals, each of whom designs a subprogram. While each of these subprograms may have consistent completions, the logic program obtained by taking the union of these subprograms may not. However, the resulting program still serves a useful purpose, for a (possibly) very large subset of it still has a consistent completion. We argue that “small” inconsistencies may cause a logic program to have no models (in the traditional sense), even though it still serves some useful purpose. A semantics is developed in this paper for general logic programs which ascribes a very reasonable meaning to general logic programs irrespective of whether they have consistent (in the classical logic sense) completions.

Path dependent analysis of logic programs

2002 ◽  
Vol 37 (3) ◽  
pp. 63-74
Author(s):  
Lunjin Lu
Keyword(s):  
Logic Programs ◽  
Path Dependent

scholarly journals Syntax-Preserving Belief Change Operators for Logic Programs

2018 ◽  
Vol 19 (2) ◽  
pp. 1-42
Author(s):  
Sebastian Binnewies ◽  
Zhiqiang Zhuang ◽  
Kewen Wang ◽  
Bela Stantic
Keyword(s):  
Belief Change ◽  
Logic Programs
Sign in / Sign up

Export Citation Format

Share Document