Cantitate/Preț
Produs
Total produse
Vezi coșul
Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning: Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday de Marcello Balduccini

Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning: Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday: Lecture Notes in Computer Science, cartea 6565

Editat de Marcello Balduccini, Tran Cao Son
en Limba Engleză Paperback – 13 mai 2011
This Festschrift volume, published in honor of Michael Gelfond on the occasion of his 65th birthday, contains a collection of papers written by his closest friends and colleagues. Several of these papers were presented during the Symposium on Constructive Mathematics in Computer Science, held in Lexington, KY, USA on October 25-26, 2010.
The 27 scientific papers included in the book focus on answer set programming. The papers are organized in sections named “Foundations: ASP and Theories of LP, KR, and NMR”, “ASP and Dynamic Domains”, and “ASP – Applications and Tools”.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33542 lei

Preț vechi: 41928 lei
-20% Nou

Puncte Express: 503
Preț estimativ în valută:
6420€ • 6772$ • 5350£

Carte tipărită la comandă

Livrare economică 03-17 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642208317
ISBN-10: 3642208312
Pagini: 530
Ilustrații: XIII, 513 p.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.77 kg
Ediția:2011
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Opening: Homage to Michael Gelfond on His 65th Birthday.- Foundations: ASP and Theories of LP, KR, and NMR: Answer Set Programming’s Contributions to Classical Logic: An Analysis of ASP Methodology.- Closure and Consistency Rationalities in Logic-Based Argumentation.- Manifold Answer-Set Programs and Their Applications.- On the Minimality of Stable Models.- Challenges in Answer Set Solving.- Exploring Relations between Answer Set Programs.- Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses.- Effectively Reasoning about Infinite Sets in Answer Set Programming.- Inspecting Side-Effects of Abduction in Logic Programs.- Argumentation and Answer Set Programming.- Interlude: Cantor’s Paradise Regained: Constructive Mathematics from Brouwer to Kolmogorov to Gelfond.- Interlude: Recollections on Michael Gelfond’s 65th Birthday.- ASP and Dynamic Domains: Evolving Logic Programs with Temporal Operators.- On Representing Actions in Multi-agent Domains.- Nonmonotonic Multi-Context Systems: A Flexible Approach for Integrating Heterogeneous Knowledge Sources.- Perspectives on Logic-Based Approaches for Reasoning about Actions and Change.- Refinement of History-Based Policies.- Translating General Game Descriptions into an Action Language.- Revisiting Epistemic Specifications.- Interlude: Answer Set; Programming?.- Interlude: Michael Gelfond: Essay in Honour of His 65th Birthday.- ASP – Applications and Tools: PLINI: A Probabilistic Logic Program Framework for Inconsistent News Information.- ASP as a Cognitive Modeling Tool: Short-Term Memory and Long-Term Memor.- A Temporally Expressive Planner Based on Answer Set Programming with Constraints: Preliminary Design.- Applications of Answer Set Programming in Phylogenetic Systematics.- ASP at Work: Spin-off and Applications of the DLV System.- Combining Answer Set Programming and Prolog: The ASP–PROLOG System.- On the Practical Side of Answer Set Programming.-ASTREA: Answer Sets for a Trusted Reasoning Environment for Agents.- Ending: Tea Times with Gelfond

Textul de pe ultima copertă

This Festschrift volume, published in honor of Michael Gelfond on the occasion of his 65th birthday, contains a collection of papers written by his closest friends and colleagues. Several of these papers were presented during the Symposium on Constructive Mathematics in Computer Science, held in Lexington, KY, USA on October 25-26, 2010.
The 27 scientific papers included in the book focus on answer set programming. The papers are organized in sections named “Foundations: ASP and Theories of LP, KR, and NMR”, “ASP and Dynamic Domains”, and “ASP – Applications and Tools”.

Caracteristici

Commemorative publication Up to date results on logic programming, knowledge representation and nonmonotonic reasoning State-of-the-art research