Answer set programming in intuitionistic logic

DOI10.1016/j.indag.2017.05.006zbMath1437.68037OpenAlexW2651218488MaRDI QIDQ1688962

Aleksy Schubert, Paweł Urzyczyn

Publication date: 12 January 2018

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.indag.2017.05.006

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17) Subsystems of classical logic (including intuitionistic logic) (03B20) Intuitionistic mathematics (03F55) Combinatory logic and lambda calculus (03B40)

Related Items (1)

First-order Answer Set Programming as Constructive Proof Search

Cites Work

• Unnamed Item
• Intuitionistic games: determinacy, completeness, and normalization
• Equilibrium logic
• Lectures on the Curry-Howard isomorphism
• Why not negation by fixpoint?
• Stable inference as intuitionistic validity
• Autoepistemic logic
• Applications of intuitionistic logic in Answer Set Programming

This page was built for publication: Answer set programming in intuitionistic logic