LPNMR-7
Chairs
Important Dates
Call for Papers
Call for System Descriptions
Program Committee
Paper Submission
Accepted Papers
Author Instructions
Invited Talks
Program
Registration
Travel Information
|
Accepted Papers
The following 24 regular papers have been accepted for LPNMR-7:
- Graphs and Colorings for Answer Set Programming: Abridged
Report
by Kathrin Konczak, Thomas Linke, Torsten Schaub
- Planning with Preferences Using Logic Programming
by Son Cao Tran, Enrico Pontelli
- Verifying the Equivalence of Logic Programs in the Disjunctive
Case
by Emilia Oikarinen, Tomi Janhunen
- Partial Stable Models for Logic Programs with Aggregates
by Nikolay Pelov, Marc Denecker, Maurice Bruynooghe
- Set Constraints in Logic Programming
by V.W. Marek, J.B. Remmel
- Properties of Iterated Multiple Belief Revision
by Dongmo Zhang
- Strong Equivalence for Causal Theories
by Hudson Turner
- Definitions in Answer Set Programming
by Selim T. Erdogan, Vladimir Lifschitz
- Towards Automated Integration of Guess and Check Programs in
Answer Set Programming
by Thomas Eiter, Axel Polleres
- Simplifying Logic Programs under Uniform and Strong Equivalence
by Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
- Uniform Equivalence for Equilibrium Logic and Logic Programs
by David Pearce, Agustin Valverde
- Reasoning about Actions and Change in Answer Set Programming
by Yannis Dimopoulos, Antonis Kakas, Loizos Michael
- Using Criticalities as a Heuristic for Answer Set Programming
by Orkunt Sabuncu, Ferda N. Alpaslan, Varol Akman
- Deduction in Ontologies via ASP
by Terrance Swift
- Probabilistic Reasoning with Answer Sets
by Chitta Baral, Michael Gelfond, Nelson Rushton
- Answer Sets: From Constraint Programming Towards Qualitative
Optimization
by Gerhard Brewka
- A Logic of Non-Monotone Inductive Definitions and its
Modularity Properties
by Marc Denecker, Eugenia Ternovska
- Almost Definite Causal Theories
by Semra Dogandag, Paolo Ferraris, Vladimir Lifschitz
- Semantics for Dynamic Logic Programming: A Principle-Based
Approach
by José Júlio Alferes, Federico Banti, António Brogi, Joăo
Alexandre Leite
- Nondefinite vs. Definite Causal Theories
by Joohyung Lee
- Improving the Model Generation/Checking Interplay to Enhance
the Evaluation of Disjunctive Programs
by Gerald Pfeifer
- Answer Set Programming with Clause Learning
by Jeffrey Ward, John S. Schlipf
- Planning with Sensing Actions and Incomplete Information using
Logic Programming
by Tran Cao Son, Phan Huy Tu, Chitta Baral
- Programs with Monotone Cardinality Atoms
by Victor W. Marek, Ilkka Niemela, Miroslaw Truszczynski
The following 8 system descriptions have been accepted for LPNMR-7:
- Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs
by Yuliya Babovich, Marco Maratea
- DLV^DB: Bridging the gap between ASP systems and DBMSs
by Nicola Leone, Vincenzino Lio, Giorgio Terracina
- nlp: A compiler for nested logic programming
by Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran
- WSAT(CC) - a fast local-search ASP solver
by Lengning Liu, Miroslaw Truszczynski
- DLV with Aggregates
by Tina Dell`Armi, Wolfgang Faber, Giuseppe Ielpa, Nicola Leone, Simona
Perri, Gerald Pfeifer
- LPEQ and DLPEQ - Translators for Automated Equivalence Testing of
Logic Programs
by Tomi Janhunen, Emilia Oikarinen
- GnT - A Solver for Disjunctive Logic Programs
by Tomi Janhunen, Ilkka Niemelä
- A Simple Scheme to Handle Aggregates in Smodels
by Son Cao Tran, Enrico Pontelli
|