default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9. LPNMR 2007: Tempe, AZ, USA
- Chitta Baral, Gerhard Brewka, John S. Schlipf:
Logic Programming and Nonmonotonic Reasoning, 9th International Conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007, Proceedings. Lecture Notes in Computer Science 4483, Springer 2007, ISBN 978-3-540-72199-4
I. Invited Talks/Competition
- Nicola Leone:
Logic Programming and Nonmonotonic Reasoning: From Theory to Systems and Applications. 1 - Jorge Lobo:
Policy-Based Computing: From Systems and Applications to Theory. 2 - Martin Gebser, Lengning Liu, Gayathri Namasivayam, André Neumann, Torsten Schaub
, Miroslaw Truszczynski:
The First Answer Set Programming System Competition. 3-17
II. Technical Papers
- Marcello Balduccini:
cr-models: An Inference Engine for CR-Prolog. 18-30 - Martin Brain, Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits, Stefan Woltran:
Debugging ASP Programs by Means of ASP. 31-43 - Pedro Cabalar, David Pearce, Panos Rondogiannis, William W. Wadge:
A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation. 44-57 - Philippe Chapdelaine, Miki Hermann, Ilka Schnoor:
Complexity of Default Logic on Generalized Conjunctive Queries. 58-70 - James P. Delgrande, Torsten Schaub, Hans Tompits:
A Preference-Based Framework for Updating Logic Programs. 71-83 - Marc Denecker, Joost Vennekens:
Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions. 84-96 - Wolfgang Faber, Nicola Leone:
On the Complexity of Answer Set Programming with Aggregates. 97-109 - Wolfgang Faber, Nicola Leone, Marco Maratea, Francesco Ricca:
Experimenting with Look-Back Heuristics for Hard ASP Programs. 110-122 - Michael Fink, Reinhard Pichler, Hans Tompits, Stefan Woltran:
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. 123-135 - Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub:
Conflict-Driven Answer Set Enumeration. 136-148 - Martin Gebser, Joohyung Lee, Yuliya Lierler:
Head-Elementary-Set-Free Logic Programs. 149-161 - Ping Hou, Johan Wittocx, Marc Denecker:
A Deductive System for PC(ID). 162-174 - Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran:
Modularity Aspects of Disjunctive Stable Models. 175-187 - Vladimir Lifschitz, David Pearce, Agustín Valverde:
A Characterization of Strong Equivalence for Logic Programs with Variables. 188-200 - Marc Meister, Khalil Djelloul, Jacques Robin:
A Unified Semantics for Constraint Handling Rules in Transaction Logic. 201-213 - Davy Van Nieuwenborgh, Thomas Eiter, Dirk Vermeir:
Conditional Planning with External Functions. 214-227 - Jia-Huai You, Li-Yan Yuan, Guohua Liu, Yi-Dong Shen:
Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities. 228-240 - Yi Zhou, Fangzhen Lin, Yan Zhang:
General Default Logic. 241-253
III. System Descriptions
- Fabrizio Angiulli, Gianluigi Greco, Luigi Palopoli, Domenico Trimboli:
The LP-OD System: Logic Programming Meets Outlier Detection. 254-259 - Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub:
clasp : A Conflict-Driven Answer Set Solver. 260-265 - Martin Gebser, Torsten Schaub, Sven Thiele:
GrinGo : A New Grounder for Answer Set Programming. 266-271 - Aaron Hunter, James P. Delgrande, Joel Faber:
Using Answer Sets to Solve Belief Change Problems. 272-277 - Gayathri Namasivayam, Miroslaw Truszczynski:
An Smodels System with Limited Lookahead Computation. 278-283 - Paolo Mancarella, Fariba Sadri, Giacomo Terreni, Francesca Toni:
Programming Applications in CIFF. 284-289 - Phan Huy Tu, Tran Cao Son, Enrico Pontelli:
CPP: A Constraint Logic Programming Based Planner with Preferences. 290-296
Posters
- Edgardo Ferretti, Marcelo Errecalde, Alejandro Javier García, Guillermo Ricardo Simari:
An Application of Defeasible Logic Programming to Decision Making in a Robotic Environment. 297-302 - Guohua Liu, Jia-Huai You:
On the Effectiveness of Looking Ahead in Search for Answer Sets. 303-308 - Juan Carlos Nieves, Mauricio Osorio, Ulises Cortés:
Semantics for Possibilistic Disjunctive Programs. 315-320 - Emilia Oikarinen:
Modularity in smodelsPrograms. 321-326
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-27 21:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
