×

Logic programming and nonmonotonic reasoning. 9th international conference, LPNMR 2007, Tempe, AZ, USA, May 15–17, 2007. Proceedings. (English) Zbl 1119.68003

Lecture Notes in Computer Science 4483. Lecture Notes in Artificial Intelligence. Berlin: Springer (ISBN 978-3-540-72199-4/pbk). ix, 327 p. (2007).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1086.68002).
Indexed articles:
Balduccini, Marcello, CR-Models: an inference engine for CR-Prolog, 18-30 [Zbl 1149.68325]
Brain, Martin; Gebser, Martin; Pührer, Jörg; Schaub, Torsten; Tompits, Hans; Woltran, Stefan, Debugging ASP programs by means of ASP, 31-43 [Zbl 1149.68326]
Cabalar, Pedro; Pearce, David; Rondogiannis, Panos; Wadge, William W., A purely model-theoretic semantics for disjunctive logic programs with negation, 44-57 [Zbl 1149.68327]
Chapdelaine, Philippe; Hermann, Miki; Schnoor, Ilka, Complexity of default logic on generalized conjunctive queries, 58-70 [Zbl 1149.68418]
Delgrande, James P.; Schaub, Torsten; Tompits, Hans, A preference-based framework for updating logic programs, 71-83 [Zbl 1149.68328]
Denecker, Marc; Vennekens, Joost, Well-founded semantics and the algebraic theory of non-monotone inductive definitions, 84-96 [Zbl 1149.68420]
Faber, Wolfgang; Leone, Nicola, On the complexity of answer set programming with aggregates, 97-109 [Zbl 1149.68329]
Faber, Wolfgang; Leone, Nicola; Maratea, Marco; Ricca, Francesco, Experimenting with look-back heuristics for hard ASP programs, 110-122 [Zbl 1149.68330]
Fink, Michael; Pichler, Reinhard; Tompits, Hans; Woltran, Stefan, Complexity of rule redundancy in non-ground answer-set programming over finite domains, 123-135 [Zbl 1149.68331]
Gebser, Martin; Kaufmann, Benjamin; Neumann, André; Schaub, Torsten, Conflict-driven answer set enumeration, 136-148 [Zbl 1149.68332]
Gebser, Martin; Lee, Joohyung; Lierler, Yuliya, Head-elementary-set-free logic programs, 149-161 [Zbl 1149.68333]
Hou, Ping; Wittocx, Johan; Denecker, Marc, A deductive system for PC(ID), 162-174 [Zbl 1149.68422]
Janhunen, Tomi; Oikarinen, Emilia; Tompits, Hans; Woltran, Stefan, Modularity aspects of disjunctive stable models, 175-187 [Zbl 1149.68334]
Lifschitz, Vladimir; Pearce, David; Valverde, Agustín, A characterization of strong equivalence for logic programs with variables, 188-200 [Zbl 1149.68335]
Meister, Marc; Djelloul, Khalil; Robin, Jacques, A unified semantics for constraint handling rules in transaction logic, 201-213 [Zbl 1149.68424]
Van Nieuwenborgh, Davy; Eiter, Thomas; Vermeir, Dirk, Conditional planning with external functions, 214-227 [Zbl 1149.68425]
You, Jia-Huai; Yuan, Li Yan; Liu, Guohua; Shen, Yi-Dong, Logic programs with abstract constraints: representaton, disjunction and complexities, 228-240 [Zbl 1149.68339]
Zhou, Yi; Lin, Fangzhen; Zhang, Yan, General default logic, 241-253 [Zbl 1149.68427]
Mellarkod, Veena S.; Gelfond, Michael, Enhancing ASP systems for planning with temporal constraints, 309-314 [Zbl 1149.68336]
Nieves, Juan Carlos; Osorio, Mauricio; Cortés, Ulises, Semantics for possibilistic disjunctive programs, 315-320 [Zbl 1149.68337]
Oikarinen, Emilia, Modularity in smodels programs, 321-326 [Zbl 1149.68338]

MSC:

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68N17 Logic programming
68T27 Logic in artificial intelligence
00B25 Proceedings of conferences of miscellaneous specific interest

Citations:

Zbl 1086.68002
Full Text: DOI