Logic Programming and Nonmonotonic Reasoning

Invited Papers.- Constraints and Probabilistic Networks: A Look At The Interface.- Toward A Universal Inference Engine.- Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative.- Regular Papers.- Semantics for Dynamic Logic Programming: A Principle-Based Approach.- Probabilistic Reasoning With Answer Sets.- Answer Sets: From Constraint Programming Towards Qualitative Optimization.- A Logic of Non-monotone Inductive Definitions and Its Modularity Properties.- Reasoning About Actions and Change in Answer Set Programming.- Almost Definite Causal Theories.- Simplifying Logic Programs Under Uniform and Strong Equivalence.- Towards Automated Integration of Guess and Check Programs in Answer Set Programming.- Towards Automated Integration of Guess and Check Programs in Answer Set Programming.- Graphs and Colorings for Answer Set Programming: Abridged Report.- Nondefinite vs. Definite Causal Theories.- Logic Programs With Monotone Cardinality Atoms.- Set Constraints in Logic Programming.- Verifying the Equivalence of Logic Programs in the Disjunctive Case.- Uniform Equivalence for Equilibrium Logic and Logic Programs.- Partial Stable Models for Logic Programs with Aggregates.- Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs.- Using Criticalities as a Heuristic for Answer Set Programming.- Planning with Preferences Using Logic Programming.- Planning with Sensing Actions and Incomplete Information Using Logic Programming.- Deduction in Ontologies via ASP.- Strong Equivalence for Causal Theories.- Answer Set Programming with Clause Learning.- Properties of Iterated Multiple Belief Revision.- System Descriptions.- System Description: DLV with Aggregates.- GNT - A Solver for Disjunctive Logic Programs.-LPEQ and DLPEQ - Translators for Automated Equivalence Testing of Logic Programs.- DLV DB : Bridging the Gap between ASP Systems and DBMSs.- Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs.- WSAT(CC) - A Fast Local-Search ASP Solver.- Smodels with CLP-A Treatment of Aggregates in ASP.- nlp: A Compiler for Nested Logic Programming.

Autorentext
Vladimir Lifschitz is a Professor of Computer Science at the University of Texas at Austin and a Fellow of the Association for the Advancement of Artificial Intelligence. He received a degree in Mathematics from the Steklov Mathematical Institute in Leningrad, USSR in 1971. A few years later he came to the United States, and his research interests turned to computational logic and knowledge representation. Lifschitz has written over 60 papers on logic programming, coined the term "answer set programming," and received several awards for publications in this area, including a Most Influential Paper in 20 Years Award and a Test of Time Award from the Association for Logic Programming. Lifschitz has served as the Editor-in-Chief of ACM Transactions on Computational Logic and as a member of the Editorial Board of the journal Artificial Intelligence.