DeepAI

# On Signings and the Well-Founded Semantics

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)

08/04/2016

In recent work we defined resource-based answer set semantics, which is ...
05/30/2021

### A Rice's Theorem for Abstract Semantics

Classical results in computability theory, notably Rice's theorem, focus...
03/30/2021

12/26/2017

### On the Semantics of Intensionality and Intensional Recursion

Intensionality is a phenomenon that occurs in logic and computation. In ...
04/29/2014

### Generalizing Modular Logic Programs

Even though modularity has been studied extensively in conventional logi...
01/15/2014

### Modularity Aspects of Disjunctive Stable Models

Practically all programming languages allow the programmer to split a pr...
10/21/1999

### Probabilistic Agent Programs

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