AI Chat AI Image Generator AI Video Text to Speech

Guarded resolution for answer set programming

04/25/2009

∙

by V. W. Marek, et al.

∙

∙

We describe a variant of resolution rule of proof and show that it is complete for stable semantics of logic programs. We show applications of this result.

V. W. Marek
2 publications
J. B. Remmel
2 publications

page 1

page 2

page 3

page 4

research

∙ 07/30/2022

Typed SLD-Resolution: Dynamic Typing for Logic Programming

The semantic foundations for logic programming are usually separated int...

0 João Barbosa, et al. ∙

research

∙ 05/02/2009

An Application of Proof-Theory in Answer Set Programming

We apply proof-theoretic techniques in answer Set Programming. The main ...

0 V. W. Marek, et al. ∙

research

∙ 06/13/2023

The Stable Model Semantics of Datalog with Metric Temporal Operators

We introduce negation under the stable model semantics in DatalogMTL - a...

0 Przemysław A. Wałęga, et al. ∙

research

∙ 12/27/2021

A Brief History of Updates of Answer-Set Programs

Over the last couple of decades, there has been a considerable effort de...

0 João Leite, et al. ∙

research

∙ 12/20/2013

A Functional View of Strong Negation in Answer Set Programming

The distinction between strong negation and default negation has been us...

0 Michael Bartholomew, et al. ∙

research

∙ 05/08/2000

A Denotational Semantics for First-Order Logic

In Apt and Bezem [AB99] (see cs.LO/9811017) we provided a computational ...

0 Krzysztof R. Apt, et al. ∙

research

∙ 06/03/2011

Semantics for Possibilistic Disjunctive Programs

In this paper, a possibilistic disjunctive logic programming approach fo...

0 Juan Carlos Nieves, et al. ∙