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.
Handbook of knowledge representation [[electronic resource] /] / edited by Bruce Porter, Vladimir Lifschitz and Frank van Harmelen
| Handbook of knowledge representation [[electronic resource] /] / edited by Bruce Porter, Vladimir Lifschitz and Frank van Harmelen |
| Autore | van Harmelen Frank |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Amsterdam, : Elsevier, 2008 |
| Descrizione fisica | 1 online resource (1035 p.) |
| Disciplina | 006.332 |
| Altri autori (Persone) |
PorterBruce <1956->
LifschitzVladimir Van HarmelenFrank |
| Collana | Foundations of artificial intelligence |
| Soggetto topico | Knowledge representation (Information theory) |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-14494-0
9786611144944 0-08-055702-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front cover; Handbook of Knowledge Representation; Copyright page; Dedication; Preface; Editors; Contributors; Contents; Part I: General Methods in Knowledge Representation and Reasoning; Chapter 1. Knowledge Representation and Classical Logic; 1.1 Knowledge Representation and Classical Logic; 1.2 Syntax, Semantics and Natural Deduction; 1.3 Automated Theorem Proving; 1.4 Applications of Automated Theorem Provers; 1.5 Suitability of Logic for Knowledge Representation; Acknowledgements; Bibliography; Chapter 2. Satisfiability Solvers; 2.1 Definitions and Notation
2.2 SAT Solver Technology-Complete Methods2.3 SAT Solver Technology-Incomplete Methods; 2.4 Runtime Variance and Problem Structure; 2.5 Beyond SAT: Quantified Boolean Formulas and Model Counting; Bibliography; Chapter 3. Description Logics; 3.1 Introduction; 3.2 A Basic DL and its Extensions; 3.3 Relationships with other Formalisms; 3.4 Tableau Based Reasoning Techniques; 3.5 Complexity; 3.6 Other Reasoning Techniques; 3.7 DLs in Ontology Language Applications; 3.8 Further Reading; Bibliography; Chapter 4. Constraint Programming; 4.1 Introduction; 4.2 Constraint Propagation; 4.3 Search 4.4 Tractability4.5 Modeling; 4.6 Soft Constraints and Optimization; 4.7 Constraint Logic Programming; 4.8 Beyond Finite Domains; 4.9 Distributed Constraint Programming; 4.10 Application Areas; 4.11 Conclusions; Bibliography; Chapter 5. Conceptual Graphs; 5.1 From Existential Graphs to Conceptual Graphs; 5.2 Common Logic; 5.3 Reasoning with Graphs; 5.4 Propositions, Situations, and Metalanguage; 5.5 Research Extensions; Bibliography; Chapter 6. Nonmonotonic Reasoning; 6.1 Introduction; 6.2 Default Logic; 6.3 Autoepistemic Logic; 6.4 Circumscription; 6.5 Nonmonotonic Inference Relations 6.6 Further Issues and ConclusionAcknowledgements; Bibliography; Chapter 7. Answer Sets; 7.1 Introduction; 7.2 Syntax and Semantics of Answer Set Prolog; 7.3 Properties of Logic Programs; 7.4 A Simple Knowledge Base; 7.5 Reasoning in Dynamic Domains; 7.6 Extensions of Answer Set Prolog; 7.7 Conclusion; Acknowledgements; Bibliography; Chapter 8. Belief Revision; 8.1 Introduction; 8.2 Preliminaries; 8.3 The AGM Paradigm; 8.4 Belief Base Change; 8.5 Multiple Belief Change; 8.6 Iterated Revision; 8.7 Non-Prioritized Revision; 8.8 Belief Update; 8.9 Conclusion; Acknowledgements; Bibliography Chapter 9. Qualitative Modeling9.1 Introduction; 9.2 Qualitative Mathematics; 9.3 Ontology; 9.4 Causality; 9.5 Compositional Modeling; 9.6 Qualitative States and Qualitative Simulation; 9.7 Qualitative Spatial Reasoning; 9.8 Qualitative Modeling Applications; 9.9 Frontiers and Resources; Bibliography; Chapter 10. Model-based Problem Solving; 10.1 Introduction; 10.2 Tasks; 10.3 Requirements on Modeling; 10.4 Diagnosis; 10.5 Test and Measurement Proposal, Diagnosability Analysis; 10.6 Remedy Proposal; 10.7 Other Tasks; 10.8 State and Challenges; Acknowledgements; Bibliography Chapter 11. Bayesian Networks |
| Record Nr. | UNINA-9910511777203321 |
van Harmelen Frank
|
||
| Amsterdam, : Elsevier, 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of knowledge representation [[electronic resource] /] / edited by Bruce Porter, Vladimir Lifschitz and Frank van Harmelen
| Handbook of knowledge representation [[electronic resource] /] / edited by Bruce Porter, Vladimir Lifschitz and Frank van Harmelen |
| Autore | van Harmelen Frank |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Amsterdam, : Elsevier, 2008 |
| Descrizione fisica | 1 online resource (1035 p.) |
| Disciplina | 006.332 |
| Altri autori (Persone) |
PorterBruce <1956->
LifschitzVladimir Van HarmelenFrank |
| Collana | Foundations of artificial intelligence |
| Soggetto topico | Knowledge representation (Information theory) |
| ISBN |
1-281-14494-0
9786611144944 0-08-055702-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front cover; Handbook of Knowledge Representation; Copyright page; Dedication; Preface; Editors; Contributors; Contents; Part I: General Methods in Knowledge Representation and Reasoning; Chapter 1. Knowledge Representation and Classical Logic; 1.1 Knowledge Representation and Classical Logic; 1.2 Syntax, Semantics and Natural Deduction; 1.3 Automated Theorem Proving; 1.4 Applications of Automated Theorem Provers; 1.5 Suitability of Logic for Knowledge Representation; Acknowledgements; Bibliography; Chapter 2. Satisfiability Solvers; 2.1 Definitions and Notation
2.2 SAT Solver Technology-Complete Methods2.3 SAT Solver Technology-Incomplete Methods; 2.4 Runtime Variance and Problem Structure; 2.5 Beyond SAT: Quantified Boolean Formulas and Model Counting; Bibliography; Chapter 3. Description Logics; 3.1 Introduction; 3.2 A Basic DL and its Extensions; 3.3 Relationships with other Formalisms; 3.4 Tableau Based Reasoning Techniques; 3.5 Complexity; 3.6 Other Reasoning Techniques; 3.7 DLs in Ontology Language Applications; 3.8 Further Reading; Bibliography; Chapter 4. Constraint Programming; 4.1 Introduction; 4.2 Constraint Propagation; 4.3 Search 4.4 Tractability4.5 Modeling; 4.6 Soft Constraints and Optimization; 4.7 Constraint Logic Programming; 4.8 Beyond Finite Domains; 4.9 Distributed Constraint Programming; 4.10 Application Areas; 4.11 Conclusions; Bibliography; Chapter 5. Conceptual Graphs; 5.1 From Existential Graphs to Conceptual Graphs; 5.2 Common Logic; 5.3 Reasoning with Graphs; 5.4 Propositions, Situations, and Metalanguage; 5.5 Research Extensions; Bibliography; Chapter 6. Nonmonotonic Reasoning; 6.1 Introduction; 6.2 Default Logic; 6.3 Autoepistemic Logic; 6.4 Circumscription; 6.5 Nonmonotonic Inference Relations 6.6 Further Issues and ConclusionAcknowledgements; Bibliography; Chapter 7. Answer Sets; 7.1 Introduction; 7.2 Syntax and Semantics of Answer Set Prolog; 7.3 Properties of Logic Programs; 7.4 A Simple Knowledge Base; 7.5 Reasoning in Dynamic Domains; 7.6 Extensions of Answer Set Prolog; 7.7 Conclusion; Acknowledgements; Bibliography; Chapter 8. Belief Revision; 8.1 Introduction; 8.2 Preliminaries; 8.3 The AGM Paradigm; 8.4 Belief Base Change; 8.5 Multiple Belief Change; 8.6 Iterated Revision; 8.7 Non-Prioritized Revision; 8.8 Belief Update; 8.9 Conclusion; Acknowledgements; Bibliography Chapter 9. Qualitative Modeling9.1 Introduction; 9.2 Qualitative Mathematics; 9.3 Ontology; 9.4 Causality; 9.5 Compositional Modeling; 9.6 Qualitative States and Qualitative Simulation; 9.7 Qualitative Spatial Reasoning; 9.8 Qualitative Modeling Applications; 9.9 Frontiers and Resources; Bibliography; Chapter 10. Model-based Problem Solving; 10.1 Introduction; 10.2 Tasks; 10.3 Requirements on Modeling; 10.4 Diagnosis; 10.5 Test and Measurement Proposal, Diagnosability Analysis; 10.6 Remedy Proposal; 10.7 Other Tasks; 10.8 State and Challenges; Acknowledgements; Bibliography Chapter 11. Bayesian Networks |
| Record Nr. | UNINA-9910784509403321 |
|
van Harmelen Frank
|
||
| Amsterdam, : Elsevier, 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of knowledge representation / / edited by Bruce Porter, Vladimir Lifschitz and Frank van Harmelen
| Handbook of knowledge representation / / edited by Bruce Porter, Vladimir Lifschitz and Frank van Harmelen |
| Autore | van Harmelen Frank |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Amsterdam, : Elsevier, 2008 |
| Descrizione fisica | 1 online resource (1035 p.) |
| Disciplina | 006.332 |
| Altri autori (Persone) |
PorterBruce <1956->
LifschitzVladimir Van HarmelenFrank |
| Collana | Foundations of artificial intelligence |
| Soggetto topico | Knowledge representation (Information theory) |
| ISBN |
1-281-14494-0
9786611144944 0-08-055702-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front cover; Handbook of Knowledge Representation; Copyright page; Dedication; Preface; Editors; Contributors; Contents; Part I: General Methods in Knowledge Representation and Reasoning; Chapter 1. Knowledge Representation and Classical Logic; 1.1 Knowledge Representation and Classical Logic; 1.2 Syntax, Semantics and Natural Deduction; 1.3 Automated Theorem Proving; 1.4 Applications of Automated Theorem Provers; 1.5 Suitability of Logic for Knowledge Representation; Acknowledgements; Bibliography; Chapter 2. Satisfiability Solvers; 2.1 Definitions and Notation
2.2 SAT Solver Technology-Complete Methods2.3 SAT Solver Technology-Incomplete Methods; 2.4 Runtime Variance and Problem Structure; 2.5 Beyond SAT: Quantified Boolean Formulas and Model Counting; Bibliography; Chapter 3. Description Logics; 3.1 Introduction; 3.2 A Basic DL and its Extensions; 3.3 Relationships with other Formalisms; 3.4 Tableau Based Reasoning Techniques; 3.5 Complexity; 3.6 Other Reasoning Techniques; 3.7 DLs in Ontology Language Applications; 3.8 Further Reading; Bibliography; Chapter 4. Constraint Programming; 4.1 Introduction; 4.2 Constraint Propagation; 4.3 Search 4.4 Tractability4.5 Modeling; 4.6 Soft Constraints and Optimization; 4.7 Constraint Logic Programming; 4.8 Beyond Finite Domains; 4.9 Distributed Constraint Programming; 4.10 Application Areas; 4.11 Conclusions; Bibliography; Chapter 5. Conceptual Graphs; 5.1 From Existential Graphs to Conceptual Graphs; 5.2 Common Logic; 5.3 Reasoning with Graphs; 5.4 Propositions, Situations, and Metalanguage; 5.5 Research Extensions; Bibliography; Chapter 6. Nonmonotonic Reasoning; 6.1 Introduction; 6.2 Default Logic; 6.3 Autoepistemic Logic; 6.4 Circumscription; 6.5 Nonmonotonic Inference Relations 6.6 Further Issues and ConclusionAcknowledgements; Bibliography; Chapter 7. Answer Sets; 7.1 Introduction; 7.2 Syntax and Semantics of Answer Set Prolog; 7.3 Properties of Logic Programs; 7.4 A Simple Knowledge Base; 7.5 Reasoning in Dynamic Domains; 7.6 Extensions of Answer Set Prolog; 7.7 Conclusion; Acknowledgements; Bibliography; Chapter 8. Belief Revision; 8.1 Introduction; 8.2 Preliminaries; 8.3 The AGM Paradigm; 8.4 Belief Base Change; 8.5 Multiple Belief Change; 8.6 Iterated Revision; 8.7 Non-Prioritized Revision; 8.8 Belief Update; 8.9 Conclusion; Acknowledgements; Bibliography Chapter 9. Qualitative Modeling9.1 Introduction; 9.2 Qualitative Mathematics; 9.3 Ontology; 9.4 Causality; 9.5 Compositional Modeling; 9.6 Qualitative States and Qualitative Simulation; 9.7 Qualitative Spatial Reasoning; 9.8 Qualitative Modeling Applications; 9.9 Frontiers and Resources; Bibliography; Chapter 10. Model-based Problem Solving; 10.1 Introduction; 10.2 Tasks; 10.3 Requirements on Modeling; 10.4 Diagnosis; 10.5 Test and Measurement Proposal, Diagnosability Analysis; 10.6 Remedy Proposal; 10.7 Other Tasks; 10.8 State and Challenges; Acknowledgements; Bibliography Chapter 11. Bayesian Networks |
| Record Nr. | UNINA-9910822759403321 |
|
van Harmelen Frank
|
||
| Amsterdam, : Elsevier, 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic Programming [[electronic resource] ] : 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004, Proceedings / / edited by Bart Demoen, Vladimir Lifschitz
| Logic Programming [[electronic resource] ] : 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004, Proceedings / / edited by Bart Demoen, Vladimir Lifschitz |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XII, 484 p.) |
| Disciplina | 005.1/15 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer programming Artificial intelligence Programming languages (Electronic computers) Computer logic Mathematical logic Software Engineering/Programming and Operating Systems Programming Techniques Artificial Intelligence Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN |
9783540277757
3-540-27775-7 |
| Classificazione | 54.51 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Termination by Abstraction -- Answer Set Programming and the Design of Deliberative Agents -- Regular Talks -- Abstract Domains Based on Regular Types -- Termination of Logic Programs Using Various Dynamic Selection Rules -- Improving Prolog Programs: Refactoring for Prolog -- Smodels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP -- The Refined Operational Semantics of Constraint Handling Rules -- Compiling Ask Constraints -- Constraint Handling Rules and Tabled Execution -- Possible Worlds Semantics for Probabilistic Logic Programs -- Limiting Resolution: From Foundations to Implementation -- Generalised Kernel Sets for Inverse Entailment -- On Programs with Linearly Ordered Multiple Preferences -- Splitting an Operator -- Simplifying Logic Programs Under Answer Set Semantics -- On Acyclic and Head-Cycle Free Nested Logic Programs -- Fast Query Evaluation with (Lazy) Control Flow Compilation -- Speculative Computations in Or-Parallel Tabled Logic Programs -- ?Prolog: A Logic Programming Language with Names, Binding and ?-Equivalence -- Implementation Results in Classical Constructive Negation -- On Hybridization of Local Search and Constraint Propagation -- Arc-Consistency + Unit Propagation = Lookahead -- The period Constraint -- Non-viability Deductions in Arc-Consistency Computation -- Compiling Prioritized Circumscription into Answer Set Programming -- Enhancing the Magic-Set Method for Disjunctive Datalog Programs -- Rectilinear Steiner Tree Construction Using Answer Set Programming -- Adding Domain Dependent Knowledge into Answer Set Programs for Planning -- Multi-agent Coordination as Distributed Logic Programming -- Logic Programs with Annotated Disjunctions -- Poster Presentations -- Abstract Interpretation-Based Mobile Code Certification -- Labeled Logic Programs -- Xcerpt and XChange – Logic Programming Languages for Querying and Evolution on the Web -- Protein Folding Simulation in CCP -- Applying CLP to Predict Extra-Functional Properties of Component-Based Models -- Main Results of the OADymPPaC Project -- FDBG, the CLP Debugger Library of SICStus Prolog -- Development of Semantic Debuggers Based on Refinement Calculus -- A Tracer Driver to Enable Debugging, Monitoring and Visualization of CLP Executions from a Single Tracer -- Grid Service Selection with PPDL -- Concurrent Constraint Programming and Tree–Based Acoustic Modelling -- MProlog: An Extension of Prolog for Modal Logic Programming -- Probabilistic Choice Operators as Global Constraints: Application to Statistical Software Testing -- Constraint-Based Synchronization and Verification of Distributed Java Programs -- JmmSolve: A Generative Java Memory Model Implemented in Prolog and CHR -- Agent Oriented Logic Programming Constructs in Jinni 2004. |
| Record Nr. | UNISA-996465420403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic Programming : 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004, Proceedings / / edited by Bart Demoen, Vladimir Lifschitz
| Logic Programming : 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004, Proceedings / / edited by Bart Demoen, Vladimir Lifschitz |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XII, 484 p.) |
| Disciplina | 005.1/15 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer programming Artificial intelligence Programming languages (Electronic computers) Computer logic Mathematical logic Software Engineering/Programming and Operating Systems Programming Techniques Artificial Intelligence Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN |
9783540277757
3-540-27775-7 |
| Classificazione | 54.51 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Termination by Abstraction -- Answer Set Programming and the Design of Deliberative Agents -- Regular Talks -- Abstract Domains Based on Regular Types -- Termination of Logic Programs Using Various Dynamic Selection Rules -- Improving Prolog Programs: Refactoring for Prolog -- Smodels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP -- The Refined Operational Semantics of Constraint Handling Rules -- Compiling Ask Constraints -- Constraint Handling Rules and Tabled Execution -- Possible Worlds Semantics for Probabilistic Logic Programs -- Limiting Resolution: From Foundations to Implementation -- Generalised Kernel Sets for Inverse Entailment -- On Programs with Linearly Ordered Multiple Preferences -- Splitting an Operator -- Simplifying Logic Programs Under Answer Set Semantics -- On Acyclic and Head-Cycle Free Nested Logic Programs -- Fast Query Evaluation with (Lazy) Control Flow Compilation -- Speculative Computations in Or-Parallel Tabled Logic Programs -- ?Prolog: A Logic Programming Language with Names, Binding and ?-Equivalence -- Implementation Results in Classical Constructive Negation -- On Hybridization of Local Search and Constraint Propagation -- Arc-Consistency + Unit Propagation = Lookahead -- The period Constraint -- Non-viability Deductions in Arc-Consistency Computation -- Compiling Prioritized Circumscription into Answer Set Programming -- Enhancing the Magic-Set Method for Disjunctive Datalog Programs -- Rectilinear Steiner Tree Construction Using Answer Set Programming -- Adding Domain Dependent Knowledge into Answer Set Programs for Planning -- Multi-agent Coordination as Distributed Logic Programming -- Logic Programs with Annotated Disjunctions -- Poster Presentations -- Abstract Interpretation-Based Mobile Code Certification -- Labeled Logic Programs -- Xcerpt and XChange – Logic Programming Languages for Querying and Evolution on the Web -- Protein Folding Simulation in CCP -- Applying CLP to Predict Extra-Functional Properties of Component-Based Models -- Main Results of the OADymPPaC Project -- FDBG, the CLP Debugger Library of SICStus Prolog -- Development of Semantic Debuggers Based on Refinement Calculus -- A Tracer Driver to Enable Debugging, Monitoring and Visualization of CLP Executions from a Single Tracer -- Grid Service Selection with PPDL -- Concurrent Constraint Programming and Tree–Based Acoustic Modelling -- MProlog: An Extension of Prolog for Modal Logic Programming -- Probabilistic Choice Operators as Global Constraints: Application to Statistical Software Testing -- Constraint-Based Synchronization and Verification of Distributed Java Programs -- JmmSolve: A Generative Java Memory Model Implemented in Prolog and CHR -- Agent Oriented Logic Programming Constructs in Jinni 2004. |
| Record Nr. | UNINA-9910144167403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic Programming and Nonmonotonic Reasoning [[electronic resource] ] : 7th International Conference, LPNMR 2004, Fort Lauderdale, FL, USA, January 6-8, 2004, Proceedings / / edited by Vladimir Lifschitz, Ilkka Niemelä
| Logic Programming and Nonmonotonic Reasoning [[electronic resource] ] : 7th International Conference, LPNMR 2004, Fort Lauderdale, FL, USA, January 6-8, 2004, Proceedings / / edited by Vladimir Lifschitz, Ilkka Niemelä |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (X, 370 p.) |
| Disciplina | 005.1/15 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Software engineering
Artificial intelligence Computer programming Mathematical logic Software Engineering/Programming and Operating Systems Artificial Intelligence Programming Techniques Mathematical Logic and Formal Languages |
| ISBN |
9786610307975
3-540-24609-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Constraints and Probabilistic Networks: A Look At The Interface -- Toward A Universal Inference Engine -- Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative -- Regular Papers -- Semantics for Dynamic Logic Programming: A Principle-Based Approach -- Probabilistic Reasoning With Answer Sets -- Answer Sets: From Constraint Programming Towards Qualitative Optimization -- A Logic of Non-monotone Inductive Definitions and Its Modularity Properties -- Reasoning About Actions and Change in Answer Set Programming -- Almost Definite Causal Theories -- Simplifying Logic Programs Under Uniform and Strong Equivalence -- Towards Automated Integration of Guess and Check Programs in Answer Set Programming -- Towards Automated Integration of Guess and Check Programs in Answer Set Programming -- Graphs and Colorings for Answer Set Programming: Abridged Report -- Nondefinite vs. Definite Causal Theories -- Logic Programs With Monotone Cardinality Atoms -- Set Constraints in Logic Programming -- Verifying the Equivalence of Logic Programs in the Disjunctive Case -- Uniform Equivalence for Equilibrium Logic and Logic Programs -- Partial Stable Models for Logic Programs with Aggregates -- Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs -- Using Criticalities as a Heuristic for Answer Set Programming -- Planning with Preferences Using Logic Programming -- Planning with Sensing Actions and Incomplete Information Using Logic Programming -- Deduction in Ontologies via ASP -- Strong Equivalence for Causal Theories -- Answer Set Programming with Clause Learning -- Properties of Iterated Multiple Belief Revision -- System Descriptions -- System Description: DLV with Aggregates -- GNT — A Solver for Disjunctive Logic Programs -- LPEQ and DLPEQ — Translators for Automated Equivalence Testing of Logic Programs -- DLV DB : Bridging the Gap between ASP Systems and DBMSs -- Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs -- WSAT(CC) — A Fast Local-Search ASP Solver -- Smodels with CLP—A Treatment of Aggregates in ASP -- nlp: A Compiler for Nested Logic Programming. |
| Record Nr. | UNISA-996466048103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic Programming and Nonmonotonic Reasoning : 7th International Conference, LPNMR 2004, Fort Lauderdale, FL, USA, January 6-8, 2004, Proceedings / / edited by Vladimir Lifschitz, Ilkka Niemelä
| Logic Programming and Nonmonotonic Reasoning : 7th International Conference, LPNMR 2004, Fort Lauderdale, FL, USA, January 6-8, 2004, Proceedings / / edited by Vladimir Lifschitz, Ilkka Niemelä |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (X, 370 p.) |
| Disciplina | 005.1/15 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Software engineering
Artificial intelligence Computer programming Mathematical logic Software Engineering/Programming and Operating Systems Artificial Intelligence Programming Techniques Mathematical Logic and Formal Languages |
| ISBN |
9786610307975
3-540-24609-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Constraints and Probabilistic Networks: A Look At The Interface -- Toward A Universal Inference Engine -- Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative -- Regular Papers -- Semantics for Dynamic Logic Programming: A Principle-Based Approach -- Probabilistic Reasoning With Answer Sets -- Answer Sets: From Constraint Programming Towards Qualitative Optimization -- A Logic of Non-monotone Inductive Definitions and Its Modularity Properties -- Reasoning About Actions and Change in Answer Set Programming -- Almost Definite Causal Theories -- Simplifying Logic Programs Under Uniform and Strong Equivalence -- Towards Automated Integration of Guess and Check Programs in Answer Set Programming -- Towards Automated Integration of Guess and Check Programs in Answer Set Programming -- Graphs and Colorings for Answer Set Programming: Abridged Report -- Nondefinite vs. Definite Causal Theories -- Logic Programs With Monotone Cardinality Atoms -- Set Constraints in Logic Programming -- Verifying the Equivalence of Logic Programs in the Disjunctive Case -- Uniform Equivalence for Equilibrium Logic and Logic Programs -- Partial Stable Models for Logic Programs with Aggregates -- Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs -- Using Criticalities as a Heuristic for Answer Set Programming -- Planning with Preferences Using Logic Programming -- Planning with Sensing Actions and Incomplete Information Using Logic Programming -- Deduction in Ontologies via ASP -- Strong Equivalence for Causal Theories -- Answer Set Programming with Clause Learning -- Properties of Iterated Multiple Belief Revision -- System Descriptions -- System Description: DLV with Aggregates -- GNT — A Solver for Disjunctive Logic Programs -- LPEQ and DLPEQ — Translators for Automated Equivalence Testing of Logic Programs -- DLV DB : Bridging the Gap between ASP Systems and DBMSs -- Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs -- WSAT(CC) — A Fast Local-Search ASP Solver -- Smodels with CLP—A Treatment of Aggregates in ASP -- nlp: A Compiler for Nested Logic Programming. |
| Record Nr. | UNINA-9910768186203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||