Answer Set Programming without Unstratified Negation
type: Item
instance of: scholarly article
title: Answer Set Programming without Unstratified Negation
zbMATH Open document ID: 1185.68172
DOI: 10.1007/978-3-540-89982-2_15
published in: Logic Programming
publication date: 2009-01-22T00:00:00Z
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 5496685
author: Ilkka Niemelä
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-540-89982-2 15
OpenAlex ID: W2168842537
cites work: Logic programs with stable model semantics as a constraint programming paradigm
cites work: Q4702577
cites work: Q3983043
cites work: Q4955344
cites work: Extending and implementing the stable model semantics
cites work: Logic programs with monotone abstract constraint atoms
Recommended article: Constraint Answer Set Programming without Grounding
Recommended article: Revisiting Explicit Negation in Answer Set Programming
Recommended article: Answer set programming based on propositional satisfiability
Recommended article: Answer set programming in intuitionistic logic
Recommended article: Q4797424
Recommended article: Negation by default and unstratifiable logic programs
Recommended article: Q4631192
Recommended article: Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence
Recommended article: Abstraction for non-ground answer set programs
description: scientific article; zbMATH DE number 5496685