Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Coherent systems [e-book] / Karl Schlechta
| Coherent systems [e-book] / Karl Schlechta |
| Autore | Schlechta, Karl |
| Pubbl/distr/stampa | Amsterdam ; Boston : Elsevier, 2004 |
| Descrizione fisica | xx, 447 p. : ill. ; 24 cm |
| Disciplina | 006.3 |
| Collana | Studies in logic and practical reasoning ; 2 |
| Soggetto topico |
Nonmonotonic reasoning
Algebraic logic Semantics - Mathematical models Modality (Logic) |
| ISBN |
9780444517890
0444517898 |
| Formato | Risorse elettroniche  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991003272649707536 |
Schlechta, Karl
|
||
| Amsterdam ; Boston : Elsevier, 2004 | ||
| Risorse elettroniche | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Explanatory nonmonotonic reasoning [[electronic resource] /] / Alexander Bochman
| Explanatory nonmonotonic reasoning [[electronic resource] /] / Alexander Bochman |
| Autore | Bochman Alexander <1955-> |
| Pubbl/distr/stampa | Hackensack, NJ, : World Scientific, c2005 |
| Descrizione fisica | 1 online resource (424 p.) |
| Disciplina | 005.115 |
| Collana | Advances in logic |
| Soggetto topico |
Nonmonotonic reasoning
Artificial intelligence |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-37254-4
9786611372545 981-256-780-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface; Contents; Chapter 1 Introduction; Chapter 2 Scott Consequence Relations; Chapter 3 Biconsequence Relations; Chapter 4 Four-Valued Logics; Chapter 5 Nonmonotonic Semantics; Chapter 6 Default Consequence Relations; Chapter 7 Argumentation Theory; Chapter 8 Production and Causal Inference; Chapter 9 Epistemic Consequence Relations; Chapter 10 Modal Nonmonotonic Logics; Bibliography; Index |
| Record Nr. | UNINA-9910450429603321 |
|
Bochman Alexander <1955->
|
||
| Hackensack, NJ, : World Scientific, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Explanatory nonmonotonic reasoning [[electronic resource] /] / Alexander Bochman
| Explanatory nonmonotonic reasoning [[electronic resource] /] / Alexander Bochman |
| Autore | Bochman Alexander <1955-> |
| Pubbl/distr/stampa | Hackensack, NJ, : World Scientific, c2005 |
| Descrizione fisica | 1 online resource (424 p.) |
| Disciplina | 005.115 |
| Collana | Advances in logic |
| Soggetto topico |
Nonmonotonic reasoning
Artificial intelligence |
| ISBN |
1-281-37254-4
9786611372545 981-256-780-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface; Contents; Chapter 1 Introduction; Chapter 2 Scott Consequence Relations; Chapter 3 Biconsequence Relations; Chapter 4 Four-Valued Logics; Chapter 5 Nonmonotonic Semantics; Chapter 6 Default Consequence Relations; Chapter 7 Argumentation Theory; Chapter 8 Production and Causal Inference; Chapter 9 Epistemic Consequence Relations; Chapter 10 Modal Nonmonotonic Logics; Bibliography; Index |
| Record Nr. | UNINA-9910783720503321 |
|
Bochman Alexander <1955->
|
||
| Hackensack, NJ, : World Scientific, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic programming and nonmonotonic reasoning : 16th international conference, LPNMR 2022, Genova, Italy, September 5-9, 2022, proceedings / / Georg Gottlob, Daniela Inclezan, Marco Maratea (editors)
| Logic programming and nonmonotonic reasoning : 16th international conference, LPNMR 2022, Genova, Italy, September 5-9, 2022, proceedings / / Georg Gottlob, Daniela Inclezan, Marco Maratea (editors) |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (536 pages) |
| Disciplina | 005.115 |
| Collana | Lecture notes in computer science. Lecture notes in artificial intelligence |
| Soggetto topico |
Logic programming
Nonmonotonic reasoning |
| ISBN | 3-031-15707-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Abstracts of Invited Talks -- DLV Evolution from Datalog to Ontology and Stream Reasoning -- Reward Machines: Formal Languages and Automata for Reinforcement Learning -- Logic-Based Machine Learning: Recent Advances and Their Role in Neuro-Symbolic AI -- Abstract Argumentation with Focus on Argument Claims - An Overview -- Contents -- Technical Contributions -- Syntactic ASP Forgetting with Forks -- 1 Introduction -- 2 Background -- 3 The Cut Operator -- 4 Forgetting into Forks: The Unfolding Operator -- 5 Conclusions -- References -- Modal Logic S5 in Answer Set Programming with Lazy Creation of Worlds -- 1 Introduction -- 2 Background -- 3 S5 Satisfiability Checking Encodings -- 4 Implementation in Answer Set Programming -- 5 Evaluation -- 6 Related Work -- 7 Conclusion -- References -- Enumeration of Minimal Models and MUSes in WASP -- 1 Introduction -- 2 Preliminaries -- 3 Enumeration of Minimal Stable Models -- 4 Enumeration of MUSes -- 5 Experiments -- 6 Related Work -- 7 Conclusions -- References -- Statistical Statements in Probabilistic Logic Programming -- 1 Introduction -- 2 Background -- 2.1 Answer Set Programming -- 2.2 Probabilistic Logic Programming -- 2.3 Credal Semantics -- 2.4 Probabilistic Conditionals -- 3 Probabilistic Answer Set Programming for Statistical Probabilities (PASTA) -- 4 Inference in PASTA -- 5 Experiments -- 6 Related Work -- 7 Conclusions -- References -- A Comparative Study of Three Neural-Symbolic Approaches to Inductive Logic Programming -- 1 Introduction -- 2 Studied Neural-Symbolic Algorithms for ILP -- 3 A Comparison Based on Four Characteristics -- 3.1 Representation of Data -- 3.2 Language Bias -- 3.3 Recursion -- 3.4 Predicate Invention -- 4 Open Challenges and Conclusion -- References -- A Definition of Sceptical Semantics in the Constellations Approach.
1 Introduction -- 2 The Constellations Approach -- 3 Related Work -- 4 The Grounded Semantics of a PrAF -- 5 Further Sceptical Semantics -- 6 Conclusions and Future Work -- References -- SHACL: A Description Logic in Disguise -- 1 Introduction -- 2 The Wedge -- 3 SHACL, OWL, and Description Logics -- 4 SHACL: The Logical Perspective -- 5 From Graphs to Interpretations -- 6 Related Work and Conclusion -- References -- Tunas - Fishing for Diverse Answer Sets: A Multi-shot Trade up Strategy -- 1 Introduction -- 2 Preliminaries -- 2.1 Multi-shot Answer Set Programming -- 2.2 Diverse Solutions -- 3 Iterative Reworking Strategies -- 3.1 Problem Definition and Complexity -- 3.2 Reworking Methods -- 4 Experimental Evaluation -- 5 Conclusion and Future Work -- References -- Emotional Reasoning in an Action Language for Emotion-Aware Planning -- 1 Introduction -- 2 Related Work -- 3 Theoretical Background -- 3.1 Emotion Theories: AE and HER -- 3.2 Action Reasoning and Transition Systems -- 4 Emotional Reasoning -- 4.1 Emotion Decision-Graph (EDG) -- 4.2 Action Language Specifications -- 4.3 Proving Safe Emotional Change -- 4.4 Example Scenario: Backward Reasoning -- 4.5 Example Scenario: Forward Reasoning -- 5 Discussion -- 6 Conclusion and Future Work -- References -- Metric Temporal Answer Set Programming over Timed Traces -- 1 Introduction -- 2 Metric Temporal Logic -- 3 Translation into Monadic Quantified Here-and-There with Difference Constraints -- 4 Discussion -- References -- Epistemic Logic Programs: A Study of Some Properties -- 1 Introduction -- 2 Answer Set Programming and Answer Set Semantics -- 3 Epistemic Logic Programs and Their Properties -- 4 Our Observations and Proposal -- 5 Discussion and Conclusions -- A Epistemic Logic Programs: Useful Properties -- References. Deep Learning for the Generation of Heuristics in Answer Set Programming: A Case Study of Graph Coloring -- 1 Introduction -- 2 Background -- 2.1 Graph Coloring Problem -- 2.2 Stable Model Search -- 2.3 Deep Neural Networks -- 3 Generation of Domain-Specific Heuristics in ASP -- 3.1 Representation of ASP Instances -- 3.2 Generation of the Training Set -- 3.3 Generation of the Deep Learning Model -- 3.4 Integration of the Deep Learning Model in wasp -- 4 Experiment -- 5 Related Work -- 6 Conclusion -- References -- A Qualitative Temporal Extension of Here-and-There Logic -- 1 Introduction -- 2 Preliminaries -- 3 Qualitative Temporal Here-and-There Logic -- 4 Temporal Tableau Calculus -- 5 Prototypical Implementation -- 6 Related Work and Conclusion -- References -- Representing Abstract Dialectical Frameworks with Binary Decision Diagrams -- 1 Introduction -- 2 Background -- 3 Representing ADFs as BDDs -- 4 Search Space Exploitation: Profiting from BDDs -- 5 Preliminary Experiments -- 6 Conclusions -- References -- Arguing Correctness of ASP Programs with Aggregates -- 1 Introduction -- 2 Review: Logic Programs via the Many-Sorted Approach -- 2.1 Syntax of Logic Programs with Aggregates -- 2.2 From Rules to Many-Sorted First-Order Formulas -- 2.3 Semantics via the SM Operator -- 3 Proving the Correctness of Logic Programs -- 3.1 The Graph Coloring Problem -- 3.2 The Traveling Salesman Problem -- 4 Conclusions and Future Work -- References -- Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination -- 1 Introduction -- 2 Preliminaries -- 3 Translating ASP into SAT Modulo Graphs/Acyclicity -- 3.1 Normalization -- 3.2 Instrumentation with Acyclicity Constraint -- 3.3 Program Completion Modulo Acyclicity -- 4 Vertex Elimination -- 5 Translating SAT Modulo Acyclicity into Pure SAT -- 6 Translating ASP into Pure SAT. 7 Experimental Evaluation -- 8 Discussion and Conclusion -- References -- IASCAR: Incremental Answer Set Counting by Anytime Refinement -- 1 Introduction -- 2 Preliminaries -- 3 Counting Supported Models -- 3.1 Counting Supported Models Under Assumptions -- 3.2 Compressing Counting Graphs -- 4 Incremental Counting by Inclusion-Exclusion -- 5 Preliminary Empirical Evaluation -- 6 Conclusion and Future Work -- References -- Reasoning About Actions with EL Ontologies and Temporal Answer Sets for DLTL -- 1 Introduction -- 2 The Description Logic EL -- 3 Temporal Action Theories in DLTL and Temporal Answer Sets -- 4 Combining Temporal Action Theories with EL Ontologies -- 5 Ontology Axioms as State Constraints -- 6 Causal Laws for Repairing Inconsistencies: Sufficient Conditions -- 7 Conclusions and Related Work -- References -- Inference to the Stable Explanations -- 1 Introduction -- 2 The Logical Framework of Defeasible Logic -- 3 Computational Problem and Methodology -- 4 Complexity Results -- 5 Abduction and Theory Change -- 6 Related Work -- 7 Conclusions and Future Investigations -- References -- Semantics for Conditional Literals via the SM Operator -- 1 Introduction -- 2 Syntax of Conditional Programs -- 3 Semantics via the SM Operator -- 4 Semantics via Infinitary Propositional Logic -- 5 Connecting Two Semantics of Conditional Programs -- 6 Arguing Correctness of the K-Coloring Problem -- References -- State Transition in Multi-agent Epistemic Domains Using Answer Set Programming -- 1 Introduction -- 2 Preliminaries -- 3 State Transition Using ASP -- 4 Properties of the State Transition Function -- 5 Example Scenarios -- 6 Related Literature -- 7 Conclusion -- References -- Towards Provenance in Heterogeneous Knowledge Bases -- 1 Introduction -- 2 Provenance Semirings -- 3 Provenance Multi-context Systems -- 4 Grounded Equilibria. 5 Conclusions -- References -- Computing Smallest MUSes of Quantified Boolean Formulas -- 1 Introduction -- 2 Preliminaries -- 3 Smallest Strong Explanations -- 4 On Complexity of Computing Smallest MUSes of QBFs -- 5 Computing Smallest MUSes via Implicit Hitting Sets -- 6 Empirical Evaluation -- 7 Conclusions -- References -- Pinpointing Axioms in Ontologies via ASP -- 1 Introduction -- 2 Preliminaries -- 3 Reasoning Through Rules -- 4 Axiom Pinpointing Through ASP -- 5 Conclusions -- References -- Interlinking Logic Programs and Argumentation Frameworks -- 1 Introduction -- 2 Preliminaries -- 3 Linking LP and AF -- 3.1 From AF to LP -- 3.2 From LP to AF -- 3.3 Bidirectional Framework -- 4 Applications -- 4.1 Deductive Argumentation -- 4.2 Argument Aggregation -- 4.3 Multi-context System -- 4.4 Constrained Argumentation Frameworks -- 5 Complexity -- 6 Concluding Remarks -- References -- Gradient-Based Supported Model Computation in Vector Spaces -- 1 Introduction -- 2 Background -- 3 Representing Logic Programs with Matrices -- 3.1 Relationship Between Positive Forms and Supported Models -- 3.2 Matrix Encoding of Logic Programs -- 4 Gradient Descent for Computing Supported Models -- 4.1 Computing the TP Operator in Vector Spaces -- 4.2 Loss Function for Computing Supported Models -- 5 Experiments -- 5.1 N-negative Loops -- 5.2 Choose 1 Out of N -- 5.3 Random Programs -- 6 Conclusion -- References -- Towards Causality-Based Conflict Resolution in Answer Set Programs -- 1 Introduction -- 2 Preliminaries -- 3 Causality-Based Conflict Resolution -- 3.1 Conflicts and Inconsistency -- 3.2 Conflict Resolution -- 4 Strategies for Conflict Resolution -- 4.1 General Satisfaction Interdependencies -- 4.2 Blocking Rules Using Opposing Rules -- 4.3 Relevant Rule Modification -- 5 Related Work -- 6 Conclusion and Future Work -- References. xASP: An Explanation Generation System for Answer Set Programming. |
| Record Nr. | UNISA-996485665603316 |
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic programming and nonmonotonic reasoning : 16th international conference, LPNMR 2022, Genova, Italy, September 5-9, 2022, proceedings / / Georg Gottlob, Daniela Inclezan, Marco Maratea (editors)
| Logic programming and nonmonotonic reasoning : 16th international conference, LPNMR 2022, Genova, Italy, September 5-9, 2022, proceedings / / Georg Gottlob, Daniela Inclezan, Marco Maratea (editors) |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (536 pages) |
| Disciplina | 005.115 |
| Collana | Lecture notes in computer science. Lecture notes in artificial intelligence |
| Soggetto topico |
Logic programming
Nonmonotonic reasoning |
| ISBN | 3-031-15707-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Abstracts of Invited Talks -- DLV Evolution from Datalog to Ontology and Stream Reasoning -- Reward Machines: Formal Languages and Automata for Reinforcement Learning -- Logic-Based Machine Learning: Recent Advances and Their Role in Neuro-Symbolic AI -- Abstract Argumentation with Focus on Argument Claims - An Overview -- Contents -- Technical Contributions -- Syntactic ASP Forgetting with Forks -- 1 Introduction -- 2 Background -- 3 The Cut Operator -- 4 Forgetting into Forks: The Unfolding Operator -- 5 Conclusions -- References -- Modal Logic S5 in Answer Set Programming with Lazy Creation of Worlds -- 1 Introduction -- 2 Background -- 3 S5 Satisfiability Checking Encodings -- 4 Implementation in Answer Set Programming -- 5 Evaluation -- 6 Related Work -- 7 Conclusion -- References -- Enumeration of Minimal Models and MUSes in WASP -- 1 Introduction -- 2 Preliminaries -- 3 Enumeration of Minimal Stable Models -- 4 Enumeration of MUSes -- 5 Experiments -- 6 Related Work -- 7 Conclusions -- References -- Statistical Statements in Probabilistic Logic Programming -- 1 Introduction -- 2 Background -- 2.1 Answer Set Programming -- 2.2 Probabilistic Logic Programming -- 2.3 Credal Semantics -- 2.4 Probabilistic Conditionals -- 3 Probabilistic Answer Set Programming for Statistical Probabilities (PASTA) -- 4 Inference in PASTA -- 5 Experiments -- 6 Related Work -- 7 Conclusions -- References -- A Comparative Study of Three Neural-Symbolic Approaches to Inductive Logic Programming -- 1 Introduction -- 2 Studied Neural-Symbolic Algorithms for ILP -- 3 A Comparison Based on Four Characteristics -- 3.1 Representation of Data -- 3.2 Language Bias -- 3.3 Recursion -- 3.4 Predicate Invention -- 4 Open Challenges and Conclusion -- References -- A Definition of Sceptical Semantics in the Constellations Approach.
1 Introduction -- 2 The Constellations Approach -- 3 Related Work -- 4 The Grounded Semantics of a PrAF -- 5 Further Sceptical Semantics -- 6 Conclusions and Future Work -- References -- SHACL: A Description Logic in Disguise -- 1 Introduction -- 2 The Wedge -- 3 SHACL, OWL, and Description Logics -- 4 SHACL: The Logical Perspective -- 5 From Graphs to Interpretations -- 6 Related Work and Conclusion -- References -- Tunas - Fishing for Diverse Answer Sets: A Multi-shot Trade up Strategy -- 1 Introduction -- 2 Preliminaries -- 2.1 Multi-shot Answer Set Programming -- 2.2 Diverse Solutions -- 3 Iterative Reworking Strategies -- 3.1 Problem Definition and Complexity -- 3.2 Reworking Methods -- 4 Experimental Evaluation -- 5 Conclusion and Future Work -- References -- Emotional Reasoning in an Action Language for Emotion-Aware Planning -- 1 Introduction -- 2 Related Work -- 3 Theoretical Background -- 3.1 Emotion Theories: AE and HER -- 3.2 Action Reasoning and Transition Systems -- 4 Emotional Reasoning -- 4.1 Emotion Decision-Graph (EDG) -- 4.2 Action Language Specifications -- 4.3 Proving Safe Emotional Change -- 4.4 Example Scenario: Backward Reasoning -- 4.5 Example Scenario: Forward Reasoning -- 5 Discussion -- 6 Conclusion and Future Work -- References -- Metric Temporal Answer Set Programming over Timed Traces -- 1 Introduction -- 2 Metric Temporal Logic -- 3 Translation into Monadic Quantified Here-and-There with Difference Constraints -- 4 Discussion -- References -- Epistemic Logic Programs: A Study of Some Properties -- 1 Introduction -- 2 Answer Set Programming and Answer Set Semantics -- 3 Epistemic Logic Programs and Their Properties -- 4 Our Observations and Proposal -- 5 Discussion and Conclusions -- A Epistemic Logic Programs: Useful Properties -- References. Deep Learning for the Generation of Heuristics in Answer Set Programming: A Case Study of Graph Coloring -- 1 Introduction -- 2 Background -- 2.1 Graph Coloring Problem -- 2.2 Stable Model Search -- 2.3 Deep Neural Networks -- 3 Generation of Domain-Specific Heuristics in ASP -- 3.1 Representation of ASP Instances -- 3.2 Generation of the Training Set -- 3.3 Generation of the Deep Learning Model -- 3.4 Integration of the Deep Learning Model in wasp -- 4 Experiment -- 5 Related Work -- 6 Conclusion -- References -- A Qualitative Temporal Extension of Here-and-There Logic -- 1 Introduction -- 2 Preliminaries -- 3 Qualitative Temporal Here-and-There Logic -- 4 Temporal Tableau Calculus -- 5 Prototypical Implementation -- 6 Related Work and Conclusion -- References -- Representing Abstract Dialectical Frameworks with Binary Decision Diagrams -- 1 Introduction -- 2 Background -- 3 Representing ADFs as BDDs -- 4 Search Space Exploitation: Profiting from BDDs -- 5 Preliminary Experiments -- 6 Conclusions -- References -- Arguing Correctness of ASP Programs with Aggregates -- 1 Introduction -- 2 Review: Logic Programs via the Many-Sorted Approach -- 2.1 Syntax of Logic Programs with Aggregates -- 2.2 From Rules to Many-Sorted First-Order Formulas -- 2.3 Semantics via the SM Operator -- 3 Proving the Correctness of Logic Programs -- 3.1 The Graph Coloring Problem -- 3.2 The Traveling Salesman Problem -- 4 Conclusions and Future Work -- References -- Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination -- 1 Introduction -- 2 Preliminaries -- 3 Translating ASP into SAT Modulo Graphs/Acyclicity -- 3.1 Normalization -- 3.2 Instrumentation with Acyclicity Constraint -- 3.3 Program Completion Modulo Acyclicity -- 4 Vertex Elimination -- 5 Translating SAT Modulo Acyclicity into Pure SAT -- 6 Translating ASP into Pure SAT. 7 Experimental Evaluation -- 8 Discussion and Conclusion -- References -- IASCAR: Incremental Answer Set Counting by Anytime Refinement -- 1 Introduction -- 2 Preliminaries -- 3 Counting Supported Models -- 3.1 Counting Supported Models Under Assumptions -- 3.2 Compressing Counting Graphs -- 4 Incremental Counting by Inclusion-Exclusion -- 5 Preliminary Empirical Evaluation -- 6 Conclusion and Future Work -- References -- Reasoning About Actions with EL Ontologies and Temporal Answer Sets for DLTL -- 1 Introduction -- 2 The Description Logic EL -- 3 Temporal Action Theories in DLTL and Temporal Answer Sets -- 4 Combining Temporal Action Theories with EL Ontologies -- 5 Ontology Axioms as State Constraints -- 6 Causal Laws for Repairing Inconsistencies: Sufficient Conditions -- 7 Conclusions and Related Work -- References -- Inference to the Stable Explanations -- 1 Introduction -- 2 The Logical Framework of Defeasible Logic -- 3 Computational Problem and Methodology -- 4 Complexity Results -- 5 Abduction and Theory Change -- 6 Related Work -- 7 Conclusions and Future Investigations -- References -- Semantics for Conditional Literals via the SM Operator -- 1 Introduction -- 2 Syntax of Conditional Programs -- 3 Semantics via the SM Operator -- 4 Semantics via Infinitary Propositional Logic -- 5 Connecting Two Semantics of Conditional Programs -- 6 Arguing Correctness of the K-Coloring Problem -- References -- State Transition in Multi-agent Epistemic Domains Using Answer Set Programming -- 1 Introduction -- 2 Preliminaries -- 3 State Transition Using ASP -- 4 Properties of the State Transition Function -- 5 Example Scenarios -- 6 Related Literature -- 7 Conclusion -- References -- Towards Provenance in Heterogeneous Knowledge Bases -- 1 Introduction -- 2 Provenance Semirings -- 3 Provenance Multi-context Systems -- 4 Grounded Equilibria. 5 Conclusions -- References -- Computing Smallest MUSes of Quantified Boolean Formulas -- 1 Introduction -- 2 Preliminaries -- 3 Smallest Strong Explanations -- 4 On Complexity of Computing Smallest MUSes of QBFs -- 5 Computing Smallest MUSes via Implicit Hitting Sets -- 6 Empirical Evaluation -- 7 Conclusions -- References -- Pinpointing Axioms in Ontologies via ASP -- 1 Introduction -- 2 Preliminaries -- 3 Reasoning Through Rules -- 4 Axiom Pinpointing Through ASP -- 5 Conclusions -- References -- Interlinking Logic Programs and Argumentation Frameworks -- 1 Introduction -- 2 Preliminaries -- 3 Linking LP and AF -- 3.1 From AF to LP -- 3.2 From LP to AF -- 3.3 Bidirectional Framework -- 4 Applications -- 4.1 Deductive Argumentation -- 4.2 Argument Aggregation -- 4.3 Multi-context System -- 4.4 Constrained Argumentation Frameworks -- 5 Complexity -- 6 Concluding Remarks -- References -- Gradient-Based Supported Model Computation in Vector Spaces -- 1 Introduction -- 2 Background -- 3 Representing Logic Programs with Matrices -- 3.1 Relationship Between Positive Forms and Supported Models -- 3.2 Matrix Encoding of Logic Programs -- 4 Gradient Descent for Computing Supported Models -- 4.1 Computing the TP Operator in Vector Spaces -- 4.2 Loss Function for Computing Supported Models -- 5 Experiments -- 5.1 N-negative Loops -- 5.2 Choose 1 Out of N -- 5.3 Random Programs -- 6 Conclusion -- References -- Towards Causality-Based Conflict Resolution in Answer Set Programs -- 1 Introduction -- 2 Preliminaries -- 3 Causality-Based Conflict Resolution -- 3.1 Conflicts and Inconsistency -- 3.2 Conflict Resolution -- 4 Strategies for Conflict Resolution -- 4.1 General Satisfaction Interdependencies -- 4.2 Blocking Rules Using Opposing Rules -- 4.3 Relevant Rule Modification -- 5 Related Work -- 6 Conclusion and Future Work -- References. xASP: An Explanation Generation System for Answer Set Programming. |
| Record Nr. | UNINA-9910590059503321 |
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic programming and nonmonotonic reasoning : 10th international conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009 : proceedings / / Ersa Erdem, Fangzhen Lin, Torsten Schaub (eds.)
| Logic programming and nonmonotonic reasoning : 10th international conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009 : proceedings / / Ersa Erdem, Fangzhen Lin, Torsten Schaub (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2009 |
| Descrizione fisica | 1 online resource (XV, 656 p.) |
| Disciplina | 004n/a |
| Altri autori (Persone) |
ErdemEsra
LinFangzhen SchaubTorsten |
| Collana | Lecture notes in computer science,Lecture notes in artificial intelligence |
| Soggetto topico |
Logic programming
Nonmonotonic reasoning |
| ISBN | 3-642-04238-4 |
| Classificazione |
DAT 706f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 1. Invited Talks -- SAT, SMT and Applications -- Logic-Based Modeling in Systems Biology -- Integrating Answer Set Programming and Satisfiability Modulo Theories -- Session 2. Technical Papers -- How Flexible Is Answer Set Programming? An Experiment in Formalizing Commonsense in ASP -- Splitting a CR-Prolog Program -- Contextual Argumentation in Ambient Intelligence -- Argumentation Context Systems: A Framework for Abstract Group Argumentation -- A Revised Concept of Safety for General Answer Set Programs -- Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs -- Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programs -- Complexity of the Stable Model Semantics for Queries on Incomplete Databases -- Manifold Answer-Set Programs for Meta-reasoning -- A Deductive System for FO(ID) Based on Least Fixpoint Logic -- Computing Stable Models via Reductions to Difference Logic -- A Module-Based Framework for Multi-language Constraint Modeling -- Induction on Failure: Learning Connected Horn Theories -- On Reductive Semantics of Aggregates in Answer Set Programming -- A First Order Forward Chaining Approach for Answer Set Computing -- Knowledge Qualification through Argumentation -- Simple Random Logic Programs -- Max-ASP: Maximum Satisfiability of Answer Set Programs -- Belief Revision with Bounded Treewidth -- Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection -- A Default Approach to Semantics of Logic Programs with Constraint Atoms -- The Complexity of Circumscriptive Inference in Post’s Lattice -- Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs -- Belief Logic Programming: Uncertainty Reasoning with Correlation of Evidence -- Weight Constraint Programs with Functions -- Session 3. Original Application Papers -- Bridging the Gap between High-Level Reasoning and Low-Level Control -- A General Approach to the Verification of Cryptographic Protocols Using Answer Set Programming -- An ASP-Based System for e-Tourism -- cc? on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions -- Session 4. Short Papers -- Translating Preferred Answer Set Programs to Propositional Logic -- CR-Prolog as a Specification Language for Constraint Satisfaction Problems -- Modeling Multi-agent Domains in an Action Languages: An Empirical Study Using -- Computing Weighted Solutions in Answer Set Programming -- Representing Multi-agent Planning in CLP -- Prototypical Reasoning with Low Complexity Description Logics: Preliminary Results -- AQL: A Query Language for Action Domains Modelled Using Answer Set Programming -- Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Programs -- Layer Supported Models of Logic Programs -- Applying ASP to UML Model Validation -- The Logical Consequence Role in LPNMR: A Parameterized Computation Approach -- Social Default Theories -- Session 5. System Descriptions -- nfn2dlp and nfnsolve: Normal Form Nested Programs Compiler and Solver -- An ASP System with Functions, Lists, and Sets -- A Simple Distributed Conflict-Driven Answer Set Solver -- An Implementation of Belief Change Operations Based on Probabilistic Conditional Logic -- On the Input Language of ASP Grounder Gringo -- The Conflict-Driven Answer Set Solver clasp: Progress Report -- System f2lp – Computing Answer Sets of First-Order Formulas -- The First Version of a New ASP Solver : ASPeRiX -- An ASP-Based Data Integration System -- Gorgias-C: Extending Argumentation with Constraint Solving -- Session 6. Summaries of Existing Successful Applications Papers -- ANTON: Composing Logic and Logic Composing -- Modelling Normative Frameworks Using Answer Set Programing -- Generating Optimal Code Using Answer Set Programming -- Logic Programming Techniques in Protein Structure Determination: Methodologies and Results -- PHYLO-ASP: Phylogenetic Systematics with Answer Set Programming -- HAPLO-ASP: Haplotype Inference Using Answer Set Programming -- Using Answer Set Programming to Enhance Operating System Discovery -- Non-monotonic Reasoning Supporting Wireless Sensor Networks for Intelligent Monitoring: The SINDI System -- Session 7. Short Application Papers -- Some DLV Applications for Knowledge Management -- Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs -- Optimal Multicore Scheduling: An Application of ASP Techniques -- Session 8 (Panel on Future Applications). Position Papers by the Panelists -- From Data Integration towards Knowledge Mediation -- Integrating Answer Set Modules into Agent Programs -- What Next for ASP? (A Not-Entirely-Well-Informed Opinion) -- Using Lightweight Inference to Solve Lightweight Problems -- Present and Future Challenges for ASP Systems -- ASP: The Future Is Bright -- Exploiting ASP in Real-World Applications: Main Strengths and Challenges -- Making Your Hands Dirty Inspires Your Brain! Or How to Switch ASP into Production Mode -- Towards an Embedded Approach to Declarative Problem Solving in ASP -- System Competition. Summary of System Competition -- The Second Answer Set Programming Competition. |
| Altri titoli varianti | LPNMR 2009 |
| Record Nr. | UNINA-9910484473503321 |
| Berlin ; ; New York, : Springer, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic programming and nonmonotonic reasoning : 9th international conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007, proceedings / / Chitta Baral, Gerhard Brewka, John Schlipf, editors
| Logic programming and nonmonotonic reasoning : 9th international conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007, proceedings / / Chitta Baral, Gerhard Brewka, John Schlipf, editors |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer-Verlag, , [2007] |
| Descrizione fisica | 1 online resource (335 p.) |
| Disciplina | 005.115 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Logic programming
Nonmonotonic reasoning |
| ISBN |
1-280-94072-7
1-280-30797-8 9786610940721 3-540-72200-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks/Competition -- Logic Programming and Nonmonotonic Reasoning: From Theory to Systems and Applications -- Policy-Based Computing: From Systems and Applications to Theory -- The First Answer Set Programming System Competition -- Technical Papers -- cr-models: An Inference Engine for CR-Prolog -- Debugging ASP Programs by Means of ASP -- A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation -- Complexity of Default Logic on Generalized Conjunctive Queries -- A Preference-Based Framework for Updating Logic Programs -- Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions -- On the Complexity of Answer Set Programming with Aggregates -- Experimenting with Look-Back Heuristics for Hard ASP Programs -- Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains -- Conflict-Driven Answer Set Enumeration -- Head-Elementary-Set-Free Logic Programs -- A Deductive System for PC(ID) -- Modularity Aspects of Disjunctive Stable Models -- A Characterization of Strong Equivalence for Logic Programs with Variables -- A Unified Semantics for Constraint Handling Rules in Transaction Logic -- Conditional Planning with External Functions -- Logic Programs with Abstract Constraints: Representation, Disjunction and Complexities -- General Default Logic -- System Descriptions -- The System: Logic Programming Meets Outlier Detection -- clasp: A Conflict-Driven Answer Set Solver -- GrinGo: A New Grounder for Answer Set Programming -- Using Answer Sets to Solve Belief Change Problems -- An Smodels System with Limited Lookahead Computation -- Programming Applications in CIFF -- CPP: A Constraint Logic Programming Based Planner with Preferences -- Posters -- An Application of Defeasible Logic Programming to Decision Making in a Robotic Environment -- On the Effectiveness of Looking Ahead in Search for Answer Sets -- Enhancing ASP Systems for Planning with Temporal Constraints -- Semantics for Possibilistic Disjunctive Programs -- Modularity in smodels Programs. |
| Record Nr. | UNINA-9910483572003321 |
| Berlin ; ; Heidelberg : , : Springer-Verlag, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic programming and nonmonotonic reasoning : 9th international conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007, proceedings / / Chitta Baral, Gerhard Brewka, John Schlipf, editors
| Logic programming and nonmonotonic reasoning : 9th international conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007, proceedings / / Chitta Baral, Gerhard Brewka, John Schlipf, editors |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer-Verlag, , [2007] |
| Descrizione fisica | 1 online resource (335 p.) |
| Disciplina | 005.115 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Logic programming
Nonmonotonic reasoning |
| ISBN |
1-280-94072-7
1-280-30797-8 9786610940721 3-540-72200-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks/Competition -- Logic Programming and Nonmonotonic Reasoning: From Theory to Systems and Applications -- Policy-Based Computing: From Systems and Applications to Theory -- The First Answer Set Programming System Competition -- Technical Papers -- cr-models: An Inference Engine for CR-Prolog -- Debugging ASP Programs by Means of ASP -- A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation -- Complexity of Default Logic on Generalized Conjunctive Queries -- A Preference-Based Framework for Updating Logic Programs -- Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions -- On the Complexity of Answer Set Programming with Aggregates -- Experimenting with Look-Back Heuristics for Hard ASP Programs -- Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains -- Conflict-Driven Answer Set Enumeration -- Head-Elementary-Set-Free Logic Programs -- A Deductive System for PC(ID) -- Modularity Aspects of Disjunctive Stable Models -- A Characterization of Strong Equivalence for Logic Programs with Variables -- A Unified Semantics for Constraint Handling Rules in Transaction Logic -- Conditional Planning with External Functions -- Logic Programs with Abstract Constraints: Representation, Disjunction and Complexities -- General Default Logic -- System Descriptions -- The System: Logic Programming Meets Outlier Detection -- clasp: A Conflict-Driven Answer Set Solver -- GrinGo: A New Grounder for Answer Set Programming -- Using Answer Sets to Solve Belief Change Problems -- An Smodels System with Limited Lookahead Computation -- Programming Applications in CIFF -- CPP: A Constraint Logic Programming Based Planner with Preferences -- Posters -- An Application of Defeasible Logic Programming to Decision Making in a Robotic Environment -- On the Effectiveness of Looking Ahead in Search for Answer Sets -- Enhancing ASP Systems for Planning with Temporal Constraints -- Semantics for Possibilistic Disjunctive Programs -- Modularity in smodels Programs. |
| Record Nr. | UNISA-996466242703316 |
| Berlin ; ; Heidelberg : , : Springer-Verlag, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic programming and nonmonotonic reasoning : 8th international conference, LPNMR 2005, Diamante, Italy, September 5-8, 2005 : proceedings / / Chitta Baral ... [et al.] (eds.)
| Logic programming and nonmonotonic reasoning : 8th international conference, LPNMR 2005, Diamante, Italy, September 5-8, 2005 : proceedings / / Chitta Baral ... [et al.] (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, 2005 |
| Descrizione fisica | 1 online resource (XIV, 462 p.) |
| Disciplina | 005.1/5 |
| Altri autori (Persone) | BaralChitta |
| Collana | Lecture notes in computer science. Lecture notes in artifical intelligence |
| Soggetto topico |
Logic programming
Nonmonotonic reasoning |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Nonmonotonic Reasoning in FLORA-2 -- Data Integration and Answer Set Programming -- Halo I: A Controlled Experiment for Large Scale Knowledge Base Development -- ASP Foundations -- Unfounded Sets for Disjunctive Logic Programs with Arbitrary Aggregates -- Loops: Relevant or Redundant? -- Approximating Answer Sets of Unitary Lifschitz-Woo Programs -- On Modular Translations and Strong Equivalence -- ASP Extensions -- Guarded Open Answer Set Programming -- External Sources of Computation for Answer Set Solvers -- Answer Sets for Propositional Theories -- Applications -- An ID-Logic Formalization of the Composition of Autonomous Databases -- On the Local Closed-World Assumption of Data-Sources -- Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming -- Actions and Causations -- An Approximation of Action Theories of and Its Application to Conformant Planning -- Game-Theoretic Reasoning About Actions in Nonmonotonic Causal Theories -- Some Logical Properties of Nonmonotonic Causal Theories -- odular-?: An Elaboration Tolerant Approach to the Ramification and Qualification Problems -- Algorithms and Computation -- Platypus: A Platform for Distributed Answer Set Solving -- Solving Hard ASP Programs Efficiently -- Mode-Directed Fixed Point Computation -- Lookahead in Smodels Compared to Local Consistencies in CSP -- Foundations -- Nested Epistemic Logic Programs -- An Algebraic Account of Modularity in ID-Logic -- Default Reasoning with Preference Within Only Knowing Logic -- Semantics -- A Social Semantics for Multi-agent Systems -- Revisiting the Semantics of Interval Probabilistic Logic Programs -- Routley Semantics for Answer Sets -- The Well Supported Semantics for Multidimensional Dynamic Logic Programs -- Application Track -- Application of Smodels in Quartet Based Phylogeny Construction -- Using Answer Set Programming for a Decision Support System -- Data Integration: a Challenging ASP Application -- Abduction and Preferences in Linguistics -- Inference of Gene Relations from Microarray Data by Abduction -- System Track -- nomore: A System for Computing Preferred Answer Sets -- Integrating an Answer Set Solver into Prolog: - -- circ2dlp — Translating Circumscription into Disjunctive Logic Programming -- Pbmodels — Software to Compute Stable Models by Pseudoboolean Solvers -- KMonitor– A Tool for Monitoring Plan Execution in Action Theories -- The nomore++ System -- Smodels A — A System for Computing Answer Sets of Logic Programs with Aggregates -- A DLP System with Object-Oriented Features -- Testing Strong Equivalence of Datalog Programs – Implementation and Examples -- SELP – A System for Studying Strong Equivalence Between Logic Programs -- cmodels – SAT-Based Disjunctive Answer Set Solver. |
| Altri titoli varianti | LPNMR 2005 |
| Record Nr. | UNINA-9910484324003321 |
| Berlin ; ; New York, : Springer, 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logics of organization theory [[electronic resource] ] : audiences, codes, and ecologies / / Michael T. Hannan, László Pólos, Glenn R. Carroll
| Logics of organization theory [[electronic resource] ] : audiences, codes, and ecologies / / Michael T. Hannan, László Pólos, Glenn R. Carroll |
| Autore | Hannan Michael T |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, N.J., : Princeton University Press, 2007 |
| Descrizione fisica | 1 online resource (381 p.) |
| Disciplina | 302.3/501 |
| Altri autori (Persone) |
PólosLászló
CarrollGlenn |
| Soggetto topico |
Organizational sociology - Methodology
Nonmonotonic reasoning Categories (Philosophy) |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-283-37992-9
9786613379924 1-4008-4301-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Preface -- Chapter 1. Language Matters -- PART 1. AUDIENCES, PRODUCERS, AND CODES -- Chapter 2. Clusters and Labels -- Chapter 3. Types and Categories -- Chapter 4. Forms and Populations -- Chapter 5. Identity and Audience -- PART 2. NONMONOTONIC REASONING: AGE DEPENDENCE -- Chapter 6. A Nonmonotonic Logic -- Chapter 7. Integrating Theories of Age Dependence -- PART 3. ECOLOGICAL NICHES -- Chapter 8. Niches and Audiences -- Chapter 9. Niches and Competitors -- Chapter 10. Resource Partitioning -- PART 4. ORGANIZATIONAL CHANGE -- Chapter 11. Cascading Change -- Chapter 12. Opacity and Asperity -- Chapter 13. Niche Expansion -- Chapter 14. Conclusions -- Appendix A. Glossary of Theoretical Terms -- Appendix B. Glossary of Symbols -- Appendix C. Some Elementary First-Order Logic -- Appendix D. Notation for Monotonic Functions -- Appendix E. The Modal Language of Codes -- Bibliography -- Index |
| Record Nr. | UNINA-9910461389203321 |
|
Hannan Michael T
|
||
| Princeton, N.J., : Princeton University Press, 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
