AI Chat AI Image Generator AI Video Text to Speech

An Application of Proof-Theory in Answer Set Programming

05/02/2009

∙

by V. W. Marek, et al.

∙

∙

We apply proof-theoretic techniques in answer Set Programming. The main results include: 1. A characterization of continuity properties of Gelfond-Lifschitz operator for logic program. 2. A propositional characterization of stable models of logic programs (without referring to loop formulas.

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

page 1

page 2

page 3

page 4

research

∙ 04/25/2009

Guarded resolution for answer set programming

We describe a variant of resolution rule of proof and show that it is co...

0 V. W. Marek, et al. ∙

research

∙ 04/26/2018

First-order answer set programming as constructive proof search

We propose an interpretation of the first-order answer set programming (...

0 Aleksy Schubert, et al. ∙

research

∙ 07/15/2023

Elementary Sets for Logic Programs

By introducing the concepts of a loop and a loop formula, Lin and Zhao s...

0 Martin Gebser, et al. ∙

research

∙ 09/30/2011

Properties and Applications of Programs with Monotone and Convex Constraints

We study properties of programs with monotone and convex constraints. We...

0 L. Liu, et al. ∙

research

∙ 07/18/2022

Positive Dependency Graphs Revisited

Theory of stable models is the mathematical basis of answer set programm...

0 Jorge Fandinno, et al. ∙

research

∙ 12/20/2013

An Algebra of Causal Chains

In this work we propose a multi-valued extension of logic programs under...

0 Pedro Cabalar, et al. ∙

research

∙ 10/10/2019

Representing All Stable Matchings by Walking a Maximal Chain

The seminal book of Gusfield and Irving [GI89] provides a compact and al...

0 Linda Cai, et al. ∙