paper-with-me

Papers

Stable Models for Infinitary Formulas with Extensional Atoms

2016-08-04 · Amelia Harrison, Vladimir Lifschitz

The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a distinction between intensional and extensional atoms. The symmetric splitting theorem for first-order formulas is then extended to infinitary formulas and used to reason about infinitary definitions. This note is under consideration for publication in Theory and Practice of Logic Programming.

📄 PDF Abstract BibTeX arXiv:1608.01603

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

On the Semantics of Gringo

2013-12-20 · Amelia Harrison, Vladimir Lifschitz, Fangkai Yang

Input languages of answer set solvers are based on the mathematically simple concept of a stable model. But many useful constructs available in these languages, including local variables, conditional literals, and aggreg…

Optimistic Higher-Order Superposition

2025-10-21 · Alexander Bentkamp, Jasmin Blanchette, Matthias Hetzenberger, Uwe Waldmann arxiv

The $λ$-superposition calculus is a successful approach to proving higher-order formulas. However, some parts of the calculus are extremely explosive, notably due to the higher-order unifier enumeration and the functiona…

SM-based Semantics for Answer Set Programs Containing Conditional Literals and Arithmetic

2025-11-03 · Zachary Hansen, Yuliya Lierler arxiv

Modern answer set programming solvers such as CLINGO support advanced language constructs that improve the expressivity and conciseness of logic programs. Conditional literals are one such construct. They form "subformul…

Modal Logic S5 Satisfiability in Answer Set Programming

2021-08-09 · Mario Alviano, Sotiris Batsakis, George Baryannis

Modal logic S5 has attracted significant attention and has led to several practical applications, owing to its simplified approach to dealing with nesting modal operators. Efficient implementations for evaluating satisfi…

Relation

Intensional Inheritance Between Concepts: An Information-Theoretic Interpretation

2025-01-29 · Ben Goertzel

This paper addresses the problem of formalizing and quantifying the concept of "intensional inheritance" between two concepts. We begin by conceiving the intensional inheritance of $W$ from $F$ as the amount of informati…