7. LPNMR 2004: Fort Lauderdale, FL, USA

Invited Papers

• Rina Dechter:
  Constraints and Probabilistic Networks: A Look At The Interface. 1
  
• Henry A. Kautz:
  Toward A Universal Inference Engine. 2
  
• Paul Borchert, Christian Anger, Torsten Schaub, Miroslaw Truszczynski:
  Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative. 3-7
  

Regular Papers

• José Júlio Alferes, Federico Banti, Antonio Brogi, João Alexandre Leite:
  Semantics for Dynamic Logic Programming: A Principle-Based Approach. 8-20
  
• Chitta Baral, Michael Gelfond, J. Nelson Rushton:
  Probabilistic Reasoning With Answer Sets. 21-33
  
• Gerhard Brewka:
  Answer Sets: From Constraint Programming Towards Qualitative Optimization. 34-46
  
• Marc Denecker, Eugenia Ternovska:
  A Logic of Non-monotone Inductive Definitions and Its Modularity Properties. 47-60
  
• Yannis Dimopoulos, Antonis C. Kakas, Loizos Michael:
  Reasoning About Actions and Change in Answer Set Programming. 61-73
  
• Semra Dogandag, Paolo Ferraris, Vladimir Lifschitz:
  Almost Definite Causal Theories. 74-86
  
• Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran:
  Simplifying Logic Programs Under Uniform and Strong Equivalence. 87-99
  
• Thomas Eiter, Axel Polleres:
  Towards Automated Integration of Guess and Check Programs in Answer Set Programming. 100-113
  
• Kathrin Konczak, Thomas Linke, Torsten Schaub:
  Graphs and Colorings for Answer Set Programming: Abridged Report. 127-140
  
• Joohyung Lee:
  Nondefinite vs. Definite Causal Theories. 141-153
  
• V. Wiktor Marek, Ilkka Niemelä, Miroslaw Truszczynski:
  Logic Programs With Monotone Cardinality Atoms. 154-166
  
• V. Wiktor Marek, Jeffrey B. Remmel:
  Set Constraints in Logic Programming. 167-179
  
• Emilia Oikarinen, Tomi Janhunen:
  Verifying the Equivalence of Logic Programs in the Disjunctive Case. 180-193
  
• David Pearce, Agustín Valverde:
  Uniform Equivalence for Equilibrium Logic and Logic Programs. 194-206
  
• Nikolay Pelov, Marc Denecker, Maurice Bruynooghe:
  Partial Stable Models for Logic Programs with Aggregates. 207-219
  
• Gerald Pfeifer:
  Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs. 220-233
  
• Orkunt Sabuncu, Ferda Nur Alpaslan, Varol Akman:
  Using Criticalities as a Heuristic for Answer Set Programming. 234-246
  
• Tran Cao Son, Enrico Pontelli:
  Planning with Preferences Using Logic Programming. 247-260
  
• Tran Cao Son, Phan Huy Tu, Chitta Baral:
  Planning with Sensing Actions and Incomplete Information Using Logic Programming. 261-274
  
• Terrance Swift:
  Deduction in Ontologies via ASP. 275-288
  
• Hudson Turner:
  Strong Equivalence for Causal Theories. 289-301
  
• Jeffrey Ward, John S. Schlipf:
  Answer Set Programming with Clause Learning. 302-313
  
• Dongmo Zhang:
  Properties of Iterated Multiple Belief Revision. 314-325
  

System Descriptions

• Tina Dell'Armi, Wolfgang Faber, Giuseppe Ielpa, Nicola Leone, Simona Perri, Gerald Pfeifer:
  System Description: DLV with Aggregates. 326-330
  
• Tomi Janhunen, Ilkka Niemelä:
  GNT - A Solver for Disjunctive Logic Programs. 331-335
  
• Tomi Janhunen, Emilia Oikarinen:
  LPEQ and DLPEQ - Translators for Automated Equivalence Testing of Logic Programs. 336-340
  
• Nicola Leone, Vincenzino Lio, Giorgio Terracina:
  DLV DB: Adding Efficient Data Management Features to ASP. 341-345
  
• Yuliya Lierler, Marco Maratea:
  Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs. 346-350
  
• Lengning Liu, Miroslaw Truszczynski:
  WSAT(CC) - A Fast Local-Search ASP Solver. 351-355
  
• Enrico Pontelli, Tran Cao Son, Islam Elkabani:
  Smodels with CLP?A Treatment of Aggregates in ASP. 356-360
  
• Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran:
  nlp: A Compiler for Nested Logic Programming. 361-364