Cantitate/Preț
Produs
Total produse
Vezi coșul
Logic Programming and Nonmonotonic Reasoning: 16th International Conference, LPNMR 2022, Genova, Italy, September 5–9, 2022, Proceedings de Georg Gottlob

Logic Programming and Nonmonotonic Reasoning: 16th International Conference, LPNMR 2022, Genova, Italy, September 5–9, 2022, Proceedings: Lecture Notes in Computer Science, cartea 13416

Editat de Georg Gottlob, Daniela Inclezan, Marco Maratea
en Limba Engleză Paperback – 27 aug 2022
This book constitutes the refereed proceedings of the 16th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2022, held in Genova, Italy, in September 2022. 

The 34 full papers and 5 short papers included in this book were carefully reviewed and selected from 57 submissions. They were organized in topical sections as follows: Technical Contributions; Systems; Applications.

Statistical Statements in Probabilistic Logic Programming” and “Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination” are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Chapters “Statistical Statements in Probabilistic Logic Programming” and “Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination” are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 47721 lei

Preț vechi: 59652 lei
-20% Nou

Puncte Express: 716
Preț estimativ în valută:
9133€ • 9487$ • 7586£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

 Adaugă în coș

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

Specificații

ISBN-13: 9783031157066
ISBN-10: 3031157060
Pagini: 512
Ilustrații: XXX, 512 p. 74 illus., 36 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.76 kg
Ediția:1st ed. 2022
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Cham, Switzerland

Cuprins

Technical Contributions.- Syntactic ASP Forgetting with Forks.- Modal Logic S5 in Answer Set Programming with Lazy Creation of Worlds.- Enumeration of minimal models and MUSes in WASP.- Statistical Statements in Probabilistic Logic Programming.- A Comparative Study of Three Neural-Symbolic Approaches to Inductive Logic Programming.- A Definition of Sceptical Semantics in the Constellations Approach.- SHACL: A Description Logic in Disguise.- Tunas - Fishing for diverse Answer Sets: a Multi-Shot Trade up Strategy.- Emotional Reasoning in an Action Language for Emotion-Aware Planning.- Metric Temporal Answer Set Programming over Timed Traces.- Epistemic Logic Programs: a study of some properties.- Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring.- A Qualitative Temporal Extension of Here-and-There Logic.- Representing Abstract Dialectical Frameworks with Binary Decision Diagrams.- Arguing Correctness of ASP Programs with Aggregates.- Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination.- IASCAR: Incremental Answer Set Counting by Anytime Refinement.- Reasoning about actions with EL ontologies and temporal answer sets for DLTL.- Inference to the Stable Explanations.- Semantics for Conditional Literals via the SM Operator.- State Transition in Multi-agent Epistemic Domains using Answer Set Programming.- Towards Provenance in Heterogeneous Knowledge Bases.- Computing Smallest MUSes of Quantified Boolean Formulas.- Pinpointing Axioms in Ontologies via ASP.- Interlinking Logic Programs and Argumentation Frameworks.- Gradient-Based Supported Model Computation in Vector Spaces.- Towards Causality-Based Conflict Resolution in Answer Set Programs.- xASP: An Explanation Generation System for Answer Set Programming.- Systems.- Solving Problems in the Polynomial Hierarchy with ASP(Q).- A Practical Account into Counting Dung’s Extensions by Dynamic Programming.- clingraph: ASP-based Visualization.- A Machine Learning System to Improve the Performance of ASP.- QMaxSATpb: A Certified MaxSAT Solver.- Applications.- Knowledge-Based Support for Adhesive Selection.- ASP for Flexible Payroll Management.- Analysis of Cyclic Fault Propagation via ASP.- Learning to Rank the Distinctiveness of Behaviour in Serial Offending.- Optimising Business Process Discovery using Answer Set Programming.- DeduDeep: an Extensible Framework for Combining Deep Learning and ASP-based Models.

Textul de pe ultima copertă

Chapters “Statistical Statements in Probabilistic Logic Programming” and “Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination” are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.