Log In Sign Up

On Signings and the Well-Founded Semantics

by   Michael J. Maher, et al.

In this note, we use Kunen's notion of a signing to establish two theorems about the well-founded semantics of logic programs, in the case where we are interested in only (say) the positive literals of a predicate p that are consequences of the program. The first theorem identifies a class of programs for which the well-founded and Fitting semantics coincide for the positive part of p. The second theorem shows that if a program has a signing then computing the positive part of p under the well-founded semantics requires the computation of only one part of each predicate. This theorem suggests an analysis for query-answering under the well-founded semantics. In the process of proving these results, we use an alternative formulation of the well-founded semantics of logic programs, which might be of independent interest. Under consideration in Theory and Practice of Logic Programming (TPLP)


page 1

page 2

page 3

page 4


Query Answering in Resource-Based Answer Set Semantics

In recent work we defined resource-based answer set semantics, which is ...

A Rice's Theorem for Abstract Semantics

Classical results in computability theory, notably Rice's theorem, focus...

Expected-Cost Analysis for Probabilistic Programs and Semantics-Level Adaption of Optional Stopping Theorems

In this article, we present a semantics-level adaption of the Optional S...

On the Semantics of Intensionality and Intensional Recursion

Intensionality is a phenomenon that occurs in logic and computation. In ...

Generalizing Modular Logic Programs

Even though modularity has been studied extensively in conventional logi...

Modularity Aspects of Disjunctive Stable Models

Practically all programming languages allow the programmer to split a pr...

Probabilistic Agent Programs

Agents are small programs that autonomously take actions based on change...