Tompits / Abreu / Oetsch Applications of Declarative Programming and Knowledge Management

19th International Conference, INAP 2011, and 25th Workshop on Logic Programming, WLP 2011, Vienna, Austria, September 28-30, 2011, Revised Selected Papers
Erscheinungsjahr 2013
ISBN: 978-3-642-41524-1
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, Band 7773, 365 Seiten, eBook

Reihe: Lecture Notes in Computer Science

This book constitutes revised selected papers of the 19th International Conference on Applications of Declarative Programming and Knowledge Management, INAP 2011, and the 25th Workshop on Logic Programming, WLP 2011, held in Vienna, Austria, in September 2011. The 19 papers presented in this volume were carefully reviewed and selected from 27 papers presented at the conference and initially a total of 35 submissions. The book also contains the papers of two invited talks. The papers are organized in topical sections on languages; answer-set programming and abductive reasoning; constraints and logic programming; answer-set programming and model expansion; application papers; and system descriptions.

Zielgruppe

Research

Autoren/Hrsg.

Tompits, Hans

Abreu, Salvador

Oetsch, Johannes

Pührer, Jörg

Seipel, Dietmar

Umeda, Masanobu

Wolf, Armin

Inhaltsverzeichnis

The IMPL Policy Language for Managing Inconsistency in Multi-Context Systems.- The Parameterized Complexity of Constraint Satisfaction and Reasoning.- Translating Nondeterministic Functional Language based on Attribute Grammars into Java.- Sensitivity Analysis for Declarative Relational Query Languages with Ordinal Ranks.- A Uniform Fixpoint Approach to the Implementation of Inference Methods for Deductive Databases.- Translating Answer-Set Programs into Bit-Vector Logic.- Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems.- Confidentiality-Preserving Publishing of EDPs for Credulous and Skeptical Users.- Every Formula-Based Logic Program Has a Least Innite-Valued Model.- A Declarative Approach for Computing Ordinal Conditional Functions Using Constraint Logic Programming.- A Descriptive Approach to Preferred Answer Sets.- Solving Modular Model Expansion: Case Studies.- FdCong: A Constraint-Based Interactive Product Congurator.- dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation.- HEX-Programs with Nested Program Calls.- A prototype of a knowledge-based programming environment.- Computing with Logic as Operator Elimination: The ToyElim System.- Coprocessor - a Standalone SAT Preprocessor.- The SeaLion has Landed: An IDE for Answer-Set Programming Preliminary Report.- Kara: A System for Visualising and Visual Editing of Interpretations for Answer-Set Programs.- Unit Testing in ASPIDE.