國立虎尾科技大學 |

Logic Programming and Nonmonotonic Reasoning = 16th International Conference, LPNMR 2022, Genova, Italy, September 5–9, 2022, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Logic Programming and Nonmonotonic Reasoning/ edited by Georg Gottlob, Daniela Inclezan, Marco Maratea.
Reminder of title:	16th International Conference, LPNMR 2022, Genova, Italy, September 5–9, 2022, Proceedings /
other author:	Gottlob, Georg.
Description:	XXX, 512 p. 74 illus., 36 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Artificial intelligence. -
Online resource:	https://doi.org/10.1007/978-3-031-15707-3
ISBN:	9783031157073

Logic Programming and Nonmonotonic Reasoning = 16th International Conference, LPNMR 2022, Genova, Italy, September 5–9, 2022, Proceedings /
Logic Programming and Nonmonotonic Reasoning16th International Conference, LPNMR 2022, Genova, Italy, September 5–9, 2022, Proceedings /[electronic resource] :edited by Georg Gottlob, Daniela Inclezan, Marco Maratea. - 1st ed. 2022. - XXX, 512 p. 74 illus., 36 illus. in color.online resource. - Lecture Notes in Artificial Intelligence,134162945-9141 ;. - Lecture Notes in Artificial Intelligence,13406.

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.

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.

ISBN: 9783031157073

Standard No.: 10.1007/978-3-031-15707-3doiSubjects--Topical Terms:

559380
Artificial intelligence.

LC Class. No.: Q334-342

Dewey Class. No.: 006.3

Logic Programming and Nonmonotonic Reasoning = 16th International Conference, LPNMR 2022, Genova, Italy, September 5–9, 2022, Proceedings /
LDR:04350nam a22004215i 4500 001 1082510
003 DE-He213
005 20221102195524.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031157073 $9 978-3-031-15707-3
024 7 $a 10.1007/978-3-031-15707-3 $2 doi
035 $a 978-3-031-15707-3
050 4 $a Q334-342
050 4 $a TA347.A78
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 006.3 $2 23
245 1 0 $a Logic Programming and Nonmonotonic Reasoning $h [electronic resource] : $b 16th International Conference, LPNMR 2022, Genova, Italy, September 5–9, 2022, Proceedings / $c edited by Georg Gottlob, Daniela Inclezan, Marco Maratea.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XXX, 512 p. 74 illus., 36 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Lecture Notes in Artificial Intelligence, $x 2945-9141 ; $v 13416
505 0 $a 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.
520 $a 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.
650 0 $a Artificial intelligence. $3 559380
650 0 $a Computer programming. $3 527822
650 0 $a Compilers (Computer programs). $3 975050
650 0 $a Computer science. $3 573171
650 0 $a Information technology—Management. $3 1365950
650 1 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Programming Techniques. $3 669781
650 2 4 $a Compilers and Interpreters. $3 1365748
650 2 4 $a Computer Science Logic and Foundations of Programming. $3 1365757
650 2 4 $a Computer Application in Administrative Data Processing. $3 1365952
700 1 $a Gottlob, Georg. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1077022
700 1 $a Inclezan, Daniela. $e editor. $1 https://orcid.org/0000-0002-4534-9658 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1388200
700 1 $a Maratea, Marco. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1274370
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031157066
776 0 8 $i Printed edition: $z 9783031157080
830 0 $a Lecture Notes in Artificial Intelligence, $x 2945-9141 ; $v 13406 $3 1387736
856 4 0 $u https://doi.org/10.1007/978-3-031-15707-3
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)