Výsledky vyhledávání - "Remmel***, J."

Report

Index sets for Finite Normal Predicate Logic Programs

Autor: Cenzer, D., Marek, V. W., Remmel, J. B.

_e is the effective list of all finite predicate logic programs. is the list of recursive trees. We modify constructions of Marek, Nerode, and Remmel [25] to construct recursive functions f and g such that for all indices e, (i) there is a o

Externí odkaz: http://arxiv.org/abs/1303.6555

Zobrazit plný text záznamu

Report

An Application of Proof-Theory in Answer Set Programming

Autor: Marek, V. W., Remmel, J. B.

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 pro

Externí odkaz: http://arxiv.org/abs/0905.0197

Zobrazit plný text záznamu

Report

Guarded resolution for answer set programming

Autor: Marek, V. W., Remmel, J. B.

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.
Comment: 13 pages, some results added. Accepted for publication at TPLP

Externí odkaz: http://arxiv.org/abs/0904.3953

Zobrazit plný text záznamu

Report

A Combinatorial Formula for the Character of the Diagonal Coinvariants

Autor: Haglund, J., Haiman, M., Loehr, N., Remmel, J. B., Ulyanov, A.

Let R_n be the ring of coinvariants for the diagonal action of the symmetric group S_n. It is known that the character of R_n as a doubly-graded S_n module can be expressed using the Frobenius characteristic map as \nabla e_n, where e_n is the n-th e

Externí odkaz: http://arxiv.org/abs/math/0310424

Zobrazit plný text záznamu