Cantitate/Preț
Produs

Applications of Declarative Programming and Knowledge Management

Editat de Hans Tompits, Salvador Abreu, Johannes Oetsch, Jörg Pührer, Dietmar Seipel, Masanobu Umeda, Armin Wolf
en Limba Engleză Paperback – 25 noi 2013
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.
Citește tot Restrânge

Preț: 32525 lei

Preț vechi: 40657 lei
-20% Nou

Puncte Express: 488

Preț estimativ în valută:
5755 6758$ 5052£

Carte tipărită la comandă

Livrare economică 27 ianuarie-10 februarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642415234
ISBN-10: 3642415237
Pagini: 380
Ilustrații: XIII, 365 p. 67 illus.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.58 kg
Ediția:2013
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Caracteristici

Proceedings of the 19th International Conference on Applications of Declarative Programming and Knowledge Management, INAP Proceedings of the 25th Workshop on Logic Programming, WLP 2011 Includes supplementary material: sn.pub/extras