- Design and results of the Fifth Answer Set Programming Competition.Francesco Calimeri, Martin Gebser, Marco Maratea & Francesco Ricca - 2016 - Artificial Intelligence 231 (C):151-181.details
|
|
Gelfond–Zhang aggregates as propositional formulas.Pedro Cabalar, Jorge Fandinno, Torsten Schaub & Sebastian Schellhorn - 2019 - Artificial Intelligence 274 (C):26-43.details
|
|
A general framework for preferences in answer set programming.Gerhard Brewka, James Delgrande, Javier Romero & Torsten Schaub - 2023 - Artificial Intelligence 325 (C):104023.details
|
|
Reasoning with infinite stable models.Piero A. Bonatti - 2004 - Artificial Intelligence 156 (1):75-111.details
|
|
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits.Blai Bonet & Héctor Geffner - 2008 - Artificial Intelligence 172 (12-13):1579-1604.details
|
|
An incremental algorithm for generating all minimal models.Rachel Ben-Eliyahu – Zohary - 2005 - Artificial Intelligence 169 (1):1-22.details
|
|
Maintenance goals of agents in a dynamic environment: Formulation and policy construction.Chitta Baral, Thomas Eiter, Marcus Bjäreland & Mutsumi Nakamura - 2008 - Artificial Intelligence 172 (12-13):1429-1469.details
|
|
Ordered completion for logic programs with aggregates.Vernon Asuncion, Yin Chen, Yan Zhang & Yi Zhou - 2015 - Artificial Intelligence 224 (C):72-102.details
|
|
Fixed point semantics for stream reasoning.Christian Antić - 2020 - Artificial Intelligence 288 (C):103370.details
|
|
Graph-based construction of minimal models.Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Fabio Fassetti & Luigi Palopoli - 2022 - Artificial Intelligence 313 (C):103754.details
|
|
Paracoherent answer set computation.Giovanni Amendola, Carmine Dodaro, Wolfgang Faber & Francesco Ricca - 2021 - Artificial Intelligence 299 (C):103519.details
|
|
Answers set programs for non-transferable utility games: Expressiveness, complexity and applications.Giovanni Amendola, Gianluigi Greco & Pierfrancesco Veltri - 2022 - Artificial Intelligence 302 (C):103606.details
|
|
Magic Sets for disjunctive Datalog programs.Mario Alviano, Wolfgang Faber, Gianluigi Greco & Nicola Leone - 2012 - Artificial Intelligence 187-188 (C):156-192.details
|
|
Approximation of action theories and its application to conformant planning.Phan Huy Tu, Tran Cao Son, Michael Gelfond & A. Ricardo Morales - 2011 - Artificial Intelligence 175 (1):79-119.details
|
|
Determining inference semantics for disjunctive logic programs.Yi-Dong Shen & Thomas Eiter - 2019 - Artificial Intelligence 277 (C):103165.details
|
|
Abstraction for non-ground answer set programs.Zeynep G. Saribatur, Thomas Eiter & Peter Schüller - 2021 - Artificial Intelligence 300 (C):103563.details
|
|
A First Order Nonmonotonic Extension of Constructive Logic.David Pearce & Agustín Valverde - 2005 - Studia Logica 80 (2):321-346.details
|
|
Logic programming as classical inference.Eric A. Martin - 2015 - Journal of Applied Logic 13 (3):316-369.details
|
|
Three-valued semantics for hybrid MKNF knowledge bases revisited.Fangfang Liu & Jia-Huai You - 2017 - Artificial Intelligence 252 (C):123-138.details
|
|
Logic programs with abstract constraint atoms: The role of computations.Lengning Liu, Enrico Pontelli, Tran Cao Son & Miroslaw Truszczyński - 2010 - Artificial Intelligence 174 (3-4):295-315.details
|
|
Abduction in logic programming: A new definition and an abductive procedure based on rewriting.Fangzhen Lin & Jia-Huai You - 2002 - Artificial Intelligence 140 (1-2):175-205.details
|
|
Answer set programming and plan generation.Vladimir Lifschitz - 2002 - Artificial Intelligence 138 (1-2):39-54.details
|
|
On abstract modular inference systems and solvers.Yuliya Lierler & Miroslaw Truszczynski - 2016 - Artificial Intelligence 236 (C):65-89.details
|
|
Some (in)translatability results for normal logic programs and propositional theories.Tomi Janhunen - 2006 - Journal of Applied Non-Classical Logics 16 (1-2):35-86.details
|
|
Vicious circle principle, aggregates, and formation of sets in ASP based languages.Michael Gelfond & Yuanlin Zhang - 2019 - Artificial Intelligence 275 (C):28-77.details
|
|
Logic programming and knowledge representation—The A-Prolog perspective.Michael Gelfond & Nicola Leone - 2002 - Artificial Intelligence 138 (1-2):3-38.details
|
|
Conflict-driven answer set solving: From theory to practice.Martin Gebser, Benjamin Kaufmann & Torsten Schaub - 2012 - Artificial Intelligence 187-188 (C):52-89.details
|
|
Abductive reasoning in neural-symbolic systems.Artur S. D’Avila Garcez, Dov M. Gabbay, Oliver Ray & John Woods - 2007 - Topoi 26 (1):37-49.details
|
|
Backdoors to tractable answer set programming.Johannes Klaus Fichte & Stefan Szeider - 2015 - Artificial Intelligence 220 (C):64-103.details
|
|
Stable models and circumscription.Paolo Ferraris, Joohyung Lee & Vladimir Lifschitz - 2011 - Artificial Intelligence 175 (1):236-263.details
|
|
Semantics and complexity of recursive aggregates in answer set programming.Wolfgang Faber, Gerald Pfeifer & Nicola Leone - 2011 - Artificial Intelligence 175 (1):278-298.details
|
|
Domain expansion for ASP-programs with external sources.Thomas Eiter, Michael Fink, Thomas Krennwallner & Christoph Redl - 2016 - Artificial Intelligence 233 (C):84-121.details
|
|
Coping with unconsidered context of formalized knowledge.Stefan Mandl & Bernd Ludwig - 2007 - In D. C. Richardson B. Kokinov (ed.), Modeling and Using Context. Springer. pp. 342--355.details
|
|
Using criticalities as a heuristic for answer set programming.Orkunt Sabuncu, Ferda N. Alpaslan & Varol Akman - 2003 - In Vladimir Lifschitz & Ilkka Niemela (eds.), Logic Programming and Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence 2923 (7th International Conference, LPNMR 2004, Fort Lauderdale, FL, January 6-8, 2004 Proceedings). Berlin, Heidelberg: Springer. pp. 234-246.details
|
|