Stable models for infinitary formulas with extensional atoms. Issue 5 (14th October 2016)
- Record Type:
- Journal Article
- Title:
- Stable models for infinitary formulas with extensional atoms. Issue 5 (14th October 2016)
- Main Title:
- Stable models for infinitary formulas with extensional atoms
- Authors:
- HARRISON, AMELIA
LIFSCHITZ, VLADIMIR - Editors:
- Carro, Manuel
King, Andy - Abstract:
- Abstract: 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.
- Is Part Of:
- Theory and practice of logic programming. Volume 16:Issue 5/6(2016)
- Journal:
- Theory and practice of logic programming
- Issue:
- Volume 16:Issue 5/6(2016)
- Issue Display:
- Volume 16, Issue 5/6 (2016)
- Year:
- 2016
- Volume:
- 16
- Issue:
- 5/6
- Issue Sort Value:
- 2016-0016-NaN-0000
- Page Start:
- 771
- Page End:
- 786
- Publication Date:
- 2016-10-14
- Subjects:
- Logic programming -- Periodicals
Artificial intelligence -- Computer programs -- Periodicals
Constraint programming (Computer science) -- Periodicals
005.115 - Journal URLs:
- https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming ↗
- DOI:
- 10.1017/S1471068416000314 ↗
- Languages:
- English
- ISSNs:
- 1471-0684
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD Digital store
- Ingest File:
- 1789.xml