Results 11 to 20 of about 677,578 (177)
Automated Termination Proofs for Logic Programs by Term Rewriting [PDF]
, 2008 There are two kinds of approaches for termination analysis of logic programs: "transformational" and "direct" ones. Direct approaches prove termination directly on the basis of the logic program. Transformational approaches transform a logic program into
Giesl, J. +3 more
core +8 more sources
Extremal problems in logic programming and stable model computation [PDF]
, 1999 We study the following problem: given a class of logic programs C, determine the maximum number of stable models of a program from C. We establish the maximum for the class of all logic programs with at most n clauses, and for the class of all logic ...
Cholewinski, Pawel +1 more
core +2 more sources
The PITA System: Tabling and Answer Subsumption for Reasoning under Uncertainty [PDF]
, 2011 Many real world domains require the representation of a measure of uncertainty. The most common such representation is probability, and the combination of probability with logic programs has given rise to the field of Probabilistic Logic Programming (PLP)
Bauters +11 more
core +1 more source
Generating Efficient, Terminating Logic Programs [PDF]
, 1997 The objective of control generation in logic programming is to automatically derive a computation rule for a program that is efficient and yet does not compromise program correctness. Progress in solving this important problem has been slow and, to date,
King, Andy, Martin, Jonthan C.
core +3 more sources
Random Logic Programs: Linear Model [PDF]
, 2014 This paper proposes a model, the linear model, for randomly generating logic programs with low density of rules and investigates statistical properties of such random logic programs. It is mathematically shown that the average number of answer sets for a
Mu, Kedian, Wang, Kewen, Wen, Lian
core +2 more sources
Logic Programming as Constructivism [PDF]
, 1989 The features of logic programming that seem unconventional from the viewpoint of classical logic can be explained in terms of constructivistic logic. We motivate and propose a constructivistic proof theory of non-Horn logic programming.
Bry, François
core +1 more source
, 2003 This note is about the relationship between two theories of negation as failure -- one based on program completion, the other based on stable models, or answer sets.
Erdem, Esra, Lifschitz, Vladimir
core +3 more sources
Decidability of the Clark's Completion Semantics for Monadic Programs and Queries [PDF]
, 2014 There are many different semantics for general logic programs (i.e. programs that use negation in the bodies of clauses). Most of these semantics are Turing complete (in a sense that can be made precise), implying that they are undecidable.
Haykazyan, Levon
core +1 more source
Answer Sets for Logic Programs with Arbitrary Abstract Constraint Atoms
, 2011 In this paper, we present two alternative approaches to defining answer sets for logic programs with arbitrary types of abstract constraint atoms (c-atoms).
Pontelli, E., Son, T. C., Tu, P. H.
core +1 more source
Crime Against History: Slavery, Race, and the 1776 Report
New Directions for Adult and Continuing Education, EarlyView.ABSTRACT With the 2025 executive order, “Ending Radical Indoctrination in K‐12 Schooling,” the Trump administration reestablished the 1776 Commission, which produced The 1776 Report. This article argues that this report, which is an unsubtle response to The 1619 Project, reveals how White Christian Nationalists wish to mandate that a hyper‐patriotic ...
William V. Trollinger
wiley +1 more source