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.
Automated Reasoning [[electronic resource] ] : Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings / / edited by Ulrich Furbach, Natarajan Shankar
| Automated Reasoning [[electronic resource] ] : Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings / / edited by Ulrich Furbach, Natarajan Shankar |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XVI, 688 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Software engineering Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Software Engineering |
| ISBN | 3-540-37188-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Mathematical Theory Exploration -- Searching While Keeping a Trace: The Evolution from Satisfiability to Knowledge Compilation -- Representing and Reasoning with Operational Semantics -- Session 1. Proofs -- Flyspeck I: Tame Graphs -- Automatic Construction and Verification of Isotopy Invariants -- Pitfalls of a Full Floating-Point Proof: Example on the Formal Proof of the Veltkamp/Dekker Algorithms -- Using the TPTP Language for Writing Derivations and Finite Interpretations -- Session 2. Search -- Stratified Context Unification Is NP-Complete -- A Logical Characterization of Forward and Backward Chaining in the Inverse Method -- Connection Tableaux with Lazy Paramodulation -- Blocking and Other Enhancements for Bottom-Up Model Generation Methods -- Session 3. System Description 1 -- The MathServe System for Semantic Web Reasoning Services -- System Description: GCLCprover + GeoThms -- A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms -- Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation -- Session 4. Higher-Order Logic -- Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics -- Towards Self-verification of HOL Light -- An Interpretation of Isabelle/HOL in HOL Light -- Combining Type Theory and Untyped Set Theory -- Session 5. Proof Theory -- Cut-Simulation in Impredicative Logics -- Interpolation in Local Theory Extensions -- Canonical Gentzen-Type Calculi with (n,k)-ary Quantifiers -- Dynamic Logic with Non-rigid Functions -- Session 6. System Description 2 -- AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework -- CEL — A Polynomial-Time Reasoner for Life Science Ontologies -- FaCT++ Description Logic Reasoner: System Description -- Importing HOL into Isabelle/HOL -- Session 7. Search -- Geometric Resolution: A Proof Procedure Based on Finite Model Search -- A Powerful Technique to Eliminate Isomorphism in Finite Model Search -- Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems -- Session 8. Proof Theory -- Strong Cut-Elimination Systems for Hudelmaier’s Depth-Bounded Sequent Calculus for Implicational Logic -- Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach -- First-Order Logic with Dependent Types -- Session 9. Proof Checking -- Automating Proofs in Category Theory -- Formal Global Optimisation with Taylor Models -- A Purely Functional Library for Modular Arithmetic and Its Application to Certifying Large Prime Numbers -- Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials -- Session 10. Combination -- A SAT-Based Decision Procedure for the Subclass of Unrollable List Formulas in ACL2 (SULFA) -- Solving Sparse Linear Constraints -- Inferring Network Invariants Automatically -- A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL -- Session 11. Decision Procedures -- Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures -- Verifying Mixed Real-Integer Quantifier Elimination -- Presburger Modal Logic Is PSPACE-Complete -- Tree Automata with Equality Constraints Modulo Equational Theories -- Session 12. CASC-J3 -- CASC-J3 The 3rd IJCAR ATP System Competition -- Session 13. Rewriting -- Matrix Interpretations for Proving Termination of Term Rewriting -- Partial Recursive Functions in Higher-Order Logic -- On the Strength of Proof-Irrelevant Type Theories -- Consistency and Completeness of Rewriting in the Calculus of Constructions -- Session 14. Description Logic -- Specifying and Reasoning About Dynamic Access-Control Policies -- On Keys and Functional Dependencies as First-Class Citizens in Description Logics -- A Resolution-Based Decision Procedure for . |
| Record Nr. | UNISA-996466163003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated reasoning : third international joint conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006 : proceedings / / Ulrich Furbach, Natarajan Shankar (eds.)
| Automated reasoning : third international joint conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006 : proceedings / / Ulrich Furbach, Natarajan Shankar (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2006 |
| Descrizione fisica | 1 online resource (XVI, 688 p.) |
| Disciplina | 006.3 |
| Altri autori (Persone) |
FurbachUlrich
ShankarN (Natarajan) |
| Collana |
Lecture notes in computer science. Lecture notes in artificial intelligence
LNCS sublibrary. SL 7, Artificial intelligence |
| Soggetto topico |
Automatic theorem proving
Computer logic |
| ISBN | 3-540-37188-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Mathematical Theory Exploration -- Searching While Keeping a Trace: The Evolution from Satisfiability to Knowledge Compilation -- Representing and Reasoning with Operational Semantics -- Session 1. Proofs -- Flyspeck I: Tame Graphs -- Automatic Construction and Verification of Isotopy Invariants -- Pitfalls of a Full Floating-Point Proof: Example on the Formal Proof of the Veltkamp/Dekker Algorithms -- Using the TPTP Language for Writing Derivations and Finite Interpretations -- Session 2. Search -- Stratified Context Unification Is NP-Complete -- A Logical Characterization of Forward and Backward Chaining in the Inverse Method -- Connection Tableaux with Lazy Paramodulation -- Blocking and Other Enhancements for Bottom-Up Model Generation Methods -- Session 3. System Description 1 -- The MathServe System for Semantic Web Reasoning Services -- System Description: GCLCprover + GeoThms -- A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms -- Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation -- Session 4. Higher-Order Logic -- Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics -- Towards Self-verification of HOL Light -- An Interpretation of Isabelle/HOL in HOL Light -- Combining Type Theory and Untyped Set Theory -- Session 5. Proof Theory -- Cut-Simulation in Impredicative Logics -- Interpolation in Local Theory Extensions -- Canonical Gentzen-Type Calculi with (n,k)-ary Quantifiers -- Dynamic Logic with Non-rigid Functions -- Session 6. System Description 2 -- AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework -- CEL — A Polynomial-Time Reasoner for Life Science Ontologies -- FaCT++ Description Logic Reasoner: System Description -- Importing HOL into Isabelle/HOL -- Session 7. Search -- Geometric Resolution: A Proof Procedure Based on Finite Model Search -- A Powerful Technique to Eliminate Isomorphism in Finite Model Search -- Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems -- Session 8. Proof Theory -- Strong Cut-Elimination Systems for Hudelmaier’s Depth-Bounded Sequent Calculus for Implicational Logic -- Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach -- First-Order Logic with Dependent Types -- Session 9. Proof Checking -- Automating Proofs in Category Theory -- Formal Global Optimisation with Taylor Models -- A Purely Functional Library for Modular Arithmetic and Its Application to Certifying Large Prime Numbers -- Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials -- Session 10. Combination -- A SAT-Based Decision Procedure for the Subclass of Unrollable List Formulas in ACL2 (SULFA) -- Solving Sparse Linear Constraints -- Inferring Network Invariants Automatically -- A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL -- Session 11. Decision Procedures -- Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures -- Verifying Mixed Real-Integer Quantifier Elimination -- Presburger Modal Logic Is PSPACE-Complete -- Tree Automata with Equality Constraints Modulo Equational Theories -- Session 12. CASC-J3 -- CASC-J3 The 3rd IJCAR ATP System Competition -- Session 13. Rewriting -- Matrix Interpretations for Proving Termination of Term Rewriting -- Partial Recursive Functions in Higher-Order Logic -- On the Strength of Proof-Irrelevant Type Theories -- Consistency and Completeness of Rewriting in the Calculus of Constructions -- Session 14. Description Logic -- Specifying and Reasoning About Dynamic Access-Control Policies -- On Keys and Functional Dependencies as First-Class Citizens in Description Logics -- A Resolution-Based Decision Procedure for . |
| Altri titoli varianti | IJCAR 2006 |
| Record Nr. | UNINA-9910767562503321 |
| Berlin, : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computational Logic — CL 2000 [[electronic resource] ] : First International Conference London, UK, July 24–28, 2000 Proceedings / / edited by John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luis M. Pereira, Yehoshua Sagiv, Peter J. Stuckey
| Computational Logic — CL 2000 [[electronic resource] ] : First International Conference London, UK, July 24–28, 2000 Proceedings / / edited by John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luis M. Pereira, Yehoshua Sagiv, Peter J. Stuckey |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XXXVIII, 1382 p. 33 illus.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Software engineering Computer systems Machine theory Computer science Computer programming Artificial Intelligence Software Engineering Computer System Implementation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Programming Techniques |
| ISBN | 3-540-44957-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Computational Logic: Memories of the Past and Challenges for the Future -- ILP: Just Do It -- Databases and Higher Types -- A Denotational Semantics for First-Order Logic -- Logic, Knowledge Representation, and Bayesian Decision Theory -- Program Development (LOPSTR) -- Logic Program Synthesis in a Higher-Order Setting -- Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction -- Binary Speed Up for Logic Programs -- A New Module System for Prolog -- Logic Programming: Theory and Extensions -- Partial Models of Extended Generalized Logic Programs -- Alternating Fixpoint Theory for Logic Programs with Priority -- Proving Failure in Functional Logic Programs -- Semantics of Input-Consuming Logic Programs -- A Denotational Semantics of Defeasible Logic -- Isoinitial Semantics for Logic Programs -- Abstract Syntax for Variable Binders: An Overview -- Goal-Directed Proof Search in Multiple-Conclusioned Intuitionistic Logic -- Efficient EM Learning with Tabulation for Parameterized Logic Programs -- Model Generation Theorem Proving with Finite Interval Constraints -- Combining Mobile Processes and Declarative Programming -- Constraints -- Representing Trees with Constraints -- Dominance Constraints with Set Operators -- Better Communication for Tighter Cooperation -- Arc Consistency Algorithms via Iterations of Subsumed Functions -- AVAL: An Enumerative Method for SAT -- Constraint Logic Programming for Local and Symbolic Model-Checking -- A CLP Framework for Computing Structural Test Data -- Modelling Digital Circuits Problems with Set Constraints -- Promoting Constraints to First-Class Status -- Developing Finite Domain Constraints — A Data Model Approach -- Concurrent Constraint Programming with Process Mobility -- A System for Tabled Constraint Logic Programming -- Automated Deduction: Putting Theory into Practice -- Finding Tractable Formulas in NNF -- The Taming of the (X)OR -- On an ?-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL -- Representing Object Code -- Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking -- Certification of Compiler Optimizations Using Kleene Algebra with Tests -- An Application of Model Building in a Resolution Decision Procedure for Guarded Formulas -- Model Checking for Timed Logic Processes -- Perfect Model Checking via Unfold/Fold Transformations -- Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions -- Proof Planning with Multiple Strategies -- The Theory of Total Unary RPO Is Decidable -- Knowledge Representation and Non-monotonic Reasoning -- On the Problem of Computing the Well-Founded Semantics -- Computing Equilibrium Models Using Signed Formulas -- Extending Classical Logic with Inductive Definitions -- A Simple Characterization of Extended Abduction -- A New Equational Foundation for the Fluent Calculus -- Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams -- Decidability Results for the Propositional Fluent Calculus -- A Meta-logical Semantics for Features and Fluents Based on Compositional Operators over Normal Logic Programs -- Default Reasoning with Specificity -- Planning under Incomplete Knowledge -- Wire Routing and Satisfiability Planning -- Including Diagnostic Information in Configuration Models -- Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs -- On Complexity of Updates through Integrity Constraints -- Computational Complexity of Planning Based on Partial Information about the System’s Present and Past States -- Smallest Equivalent Sets for Finite Propositional Formula Circumscription -- A Semantics for Persistency in Propositional Dynamic Logic -- Database Systems (DOOD) -- Applications of Annotated Predicate Calculus to Querying Inconsistent Databases -- Querying Inconsistent Databases: Algorithms and Implementation -- On Verification in Logic Database Languages -- Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets -- Linearly Bounded Reformulations of Conjunctive Databases -- MuTACLP: A Language for Declarative GIS Analysis -- Reasoning about Duplicate Elimination with Description Logic -- A File System Based on Concept Analysis -- A Semantic Approach for Schema Evolution and Versioning in Object-Oriented Databases -- SLDMagic — The Real Magic (With Applications to Web Queries) -- FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine -- Design and Implementation of the Physical Layer in WebBases: The XRover Experience -- A Dynamic Approach to Termination Analysis for Active Database Rules -- Constraint-Based Termination Analysis for Cyclic Active Database Rules -- A Formal Model for an Expressive Fragment of XSLT -- On the Equivalence of XML Patterns -- Querying XML Specified WWW Sites: Links and Recursion in XML-GL -- A Heuristic Approach for Converting HTML Documents to XML Documents -- Specification of an Active Database System Application Using Dynamic Relation Nets -- Invariance, Maintenance, and Other Declarative Objectives of Triggers — A Formal Characterization of Active Databases -- Logic Programming: Implementations and Applications -- Fluents: A Refactoring of Prolog for Uniform Reflection and Interoperation with External Objects -- So Many WAM Variations, So Little Time -- A Module Based Analysis for Memory Reuse in Mercury -- Mode Checking in HAL -- The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems -- Data Protection by Logic Programming -- A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language -- A Logic Programming Application for the Analysis of Spanish Verse -- A Documentation Generator for (C)LP Systems -- Psychiatric Diagnosis from the Viewpoint of Computational Logic. |
| Record Nr. | UNISA-996465565903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computational Logic — CL 2000 : First International Conference London, UK, July 24–28, 2000 Proceedings / / edited by John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luis M. Pereira, Yehoshua Sagiv, Peter J. Stuckey
| Computational Logic — CL 2000 : First International Conference London, UK, July 24–28, 2000 Proceedings / / edited by John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luis M. Pereira, Yehoshua Sagiv, Peter J. Stuckey |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XXXVIII, 1382 p. 33 illus.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Software engineering Computer systems Machine theory Computer science Computer programming Artificial Intelligence Software Engineering Computer System Implementation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Programming Techniques |
| ISBN | 3-540-44957-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Computational Logic: Memories of the Past and Challenges for the Future -- ILP: Just Do It -- Databases and Higher Types -- A Denotational Semantics for First-Order Logic -- Logic, Knowledge Representation, and Bayesian Decision Theory -- Program Development (LOPSTR) -- Logic Program Synthesis in a Higher-Order Setting -- Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction -- Binary Speed Up for Logic Programs -- A New Module System for Prolog -- Logic Programming: Theory and Extensions -- Partial Models of Extended Generalized Logic Programs -- Alternating Fixpoint Theory for Logic Programs with Priority -- Proving Failure in Functional Logic Programs -- Semantics of Input-Consuming Logic Programs -- A Denotational Semantics of Defeasible Logic -- Isoinitial Semantics for Logic Programs -- Abstract Syntax for Variable Binders: An Overview -- Goal-Directed Proof Search in Multiple-Conclusioned Intuitionistic Logic -- Efficient EM Learning with Tabulation for Parameterized Logic Programs -- Model Generation Theorem Proving with Finite Interval Constraints -- Combining Mobile Processes and Declarative Programming -- Constraints -- Representing Trees with Constraints -- Dominance Constraints with Set Operators -- Better Communication for Tighter Cooperation -- Arc Consistency Algorithms via Iterations of Subsumed Functions -- AVAL: An Enumerative Method for SAT -- Constraint Logic Programming for Local and Symbolic Model-Checking -- A CLP Framework for Computing Structural Test Data -- Modelling Digital Circuits Problems with Set Constraints -- Promoting Constraints to First-Class Status -- Developing Finite Domain Constraints — A Data Model Approach -- Concurrent Constraint Programming with Process Mobility -- A System for Tabled Constraint Logic Programming -- Automated Deduction: Putting Theory into Practice -- Finding Tractable Formulas in NNF -- The Taming of the (X)OR -- On an ?-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL -- Representing Object Code -- Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking -- Certification of Compiler Optimizations Using Kleene Algebra with Tests -- An Application of Model Building in a Resolution Decision Procedure for Guarded Formulas -- Model Checking for Timed Logic Processes -- Perfect Model Checking via Unfold/Fold Transformations -- Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions -- Proof Planning with Multiple Strategies -- The Theory of Total Unary RPO Is Decidable -- Knowledge Representation and Non-monotonic Reasoning -- On the Problem of Computing the Well-Founded Semantics -- Computing Equilibrium Models Using Signed Formulas -- Extending Classical Logic with Inductive Definitions -- A Simple Characterization of Extended Abduction -- A New Equational Foundation for the Fluent Calculus -- Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams -- Decidability Results for the Propositional Fluent Calculus -- A Meta-logical Semantics for Features and Fluents Based on Compositional Operators over Normal Logic Programs -- Default Reasoning with Specificity -- Planning under Incomplete Knowledge -- Wire Routing and Satisfiability Planning -- Including Diagnostic Information in Configuration Models -- Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs -- On Complexity of Updates through Integrity Constraints -- Computational Complexity of Planning Based on Partial Information about the System’s Present and Past States -- Smallest Equivalent Sets for Finite Propositional Formula Circumscription -- A Semantics for Persistency in Propositional Dynamic Logic -- Database Systems (DOOD) -- Applications of Annotated Predicate Calculus to Querying Inconsistent Databases -- Querying Inconsistent Databases: Algorithms and Implementation -- On Verification in Logic Database Languages -- Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets -- Linearly Bounded Reformulations of Conjunctive Databases -- MuTACLP: A Language for Declarative GIS Analysis -- Reasoning about Duplicate Elimination with Description Logic -- A File System Based on Concept Analysis -- A Semantic Approach for Schema Evolution and Versioning in Object-Oriented Databases -- SLDMagic — The Real Magic (With Applications to Web Queries) -- FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine -- Design and Implementation of the Physical Layer in WebBases: The XRover Experience -- A Dynamic Approach to Termination Analysis for Active Database Rules -- Constraint-Based Termination Analysis for Cyclic Active Database Rules -- A Formal Model for an Expressive Fragment of XSLT -- On the Equivalence of XML Patterns -- Querying XML Specified WWW Sites: Links and Recursion in XML-GL -- A Heuristic Approach for Converting HTML Documents to XML Documents -- Specification of an Active Database System Application Using Dynamic Relation Nets -- Invariance, Maintenance, and Other Declarative Objectives of Triggers — A Formal Characterization of Active Databases -- Logic Programming: Implementations and Applications -- Fluents: A Refactoring of Prolog for Uniform Reflection and Interoperation with External Objects -- So Many WAM Variations, So Little Time -- A Module Based Analysis for Memory Reuse in Mercury -- Mode Checking in HAL -- The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems -- Data Protection by Logic Programming -- A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language -- A Logic Programming Application for the Analysis of Spanish Verse -- A Documentation Generator for (C)LP Systems -- Psychiatric Diagnosis from the Viewpoint of Computational Logic. |
| Record Nr. | UNINA-9910143626303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
A different look at artificial intelligence : on tour with Bergson, Proust and Nabokov / / Ulrike Barthelmeß, Ulrich Furbach
| A different look at artificial intelligence : on tour with Bergson, Proust and Nabokov / / Ulrike Barthelmeß, Ulrich Furbach |
| Autore | Barthelmess Ulrike |
| Pubbl/distr/stampa | Wiesbaden, Germany : , : Springer, , [2023] |
| Descrizione fisica | 1 online resource (172 pages) |
| Disciplina | 006.3 |
| Soggetto topico | Artificial intelligence - Philosophy |
| ISBN | 3-658-38474-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Acknowledgements -- Reference -- Contents -- 1: Introduction -- Reference -- 2: Artificial Intelligence -- 2.1 What Is Artificial Intelligence? -- 2.2 The Imitation Game -- 2.3 The Computer -- 2.4 Turing's Objections -- Theology and Head in the Sand -- Mathematics -- Consciousness -- Learning -- 2.5 Turing and Nouvelle AI -- 2.6 The Chinese Room -- 2.7 Alternative Turing Tests -- 2.8 Status of AI -- Deep Question Answering -- Autonomous Vehicles -- Mathematics -- Go -- 2.9 Why Only Now? -- 2.10 Strong and Weak AI -- References -- 3: Mind and Body -- 3.1 Body and Mind Over Time -- 3.2 AI: Intelligence Without a Body? -- 3.3 AI and Transhumanism -- 3.4 Summary -- References -- 4: Time and Memory -- 4.1 Time in Artificial Systems -- 4.2 Bergson's Concept of Remembering -- 4.3 Summary -- References -- 5: Representation of Knowledge -- 5.1 Logic and Knowledge: Symbolic Representation -- Aristotle -- Enlightenment -- 5.2 Cognitive Revolution -- 5.3 The Heyday of AI -- 5.4 Cognitive Computing -- 5.5 Artificial Neural Networks -- References -- 6: Mnemonics -- 6.1 Summary -- References -- 7: The Art of Seeing -- 7.1 Art as Mental Gymnastics -- 7.2 Interaction of Art and Science -- Influence of Biological and Evolutionary Theory -- Influence of Freudian Psychoanalysis -- 7.3 The Viewer in the Focus of Art History -- 7.4 Images in the Brain and in AI -- Neurobiological Aspects of Perception -- Image Processing in AI -- What We Can Learn from the Brain -- 7.5 Summary -- References -- 8: Free Will -- 8.1 Free Will in Artificial Systems -- 8.2 Bergson's Intuition -- 8.3 From the Categorical Imperative to the Free Choice of Memory -- 8.4 The Libet Experiment -- 8.5 Summary -- References -- 9: Remembering: A Creative Act -- 9.1 Proust's Memories as a Process -- 9.2 Remembering in Neural Networks.
9.3 Remembering in Artificial Systems -- 9.4 Creativity in AI -- 9.5 Nabokov's Memory Patterns -- 9.6 Summary -- References -- 10: Frame and Structure -- 10.1 Framework in AI -- 10.2 Summary -- References -- 11: Consciousness -- 11.1 Qualia -- 11.2 The Role of the Body -- 11.3 The Theatre Model -- The Stage -- The Headlight -- The Actors -- The Context Behind the Scenes -- The Spectators -- 11.4 Consciousness in AI -- 11.5 Summary -- References -- 12: Language -- 12.1 Language in AI -- 12.2 Theories of Language in Linguistics -- 12.3 Summary -- References -- 13: Epilogue -- 13.1 The Blind and the Elephant. |
| Record Nr. | UNINA-9910639900003321 |
Barthelmess Ulrike
|
||
| Wiesbaden, Germany : , : Springer, , [2023] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
A different look at artificial intelligence : on tour with Bergson, Proust and Nabokov / / Ulrike Barthelmeß, Ulrich Furbach
| A different look at artificial intelligence : on tour with Bergson, Proust and Nabokov / / Ulrike Barthelmeß, Ulrich Furbach |
| Autore | Barthelmess Ulrike |
| Pubbl/distr/stampa | Wiesbaden, Germany : , : Springer, , [2023] |
| Descrizione fisica | 1 online resource (172 pages) |
| Disciplina | 006.3 |
| Soggetto topico | Artificial intelligence - Philosophy |
| ISBN | 3-658-38474-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Acknowledgements -- Reference -- Contents -- 1: Introduction -- Reference -- 2: Artificial Intelligence -- 2.1 What Is Artificial Intelligence? -- 2.2 The Imitation Game -- 2.3 The Computer -- 2.4 Turing's Objections -- Theology and Head in the Sand -- Mathematics -- Consciousness -- Learning -- 2.5 Turing and Nouvelle AI -- 2.6 The Chinese Room -- 2.7 Alternative Turing Tests -- 2.8 Status of AI -- Deep Question Answering -- Autonomous Vehicles -- Mathematics -- Go -- 2.9 Why Only Now? -- 2.10 Strong and Weak AI -- References -- 3: Mind and Body -- 3.1 Body and Mind Over Time -- 3.2 AI: Intelligence Without a Body? -- 3.3 AI and Transhumanism -- 3.4 Summary -- References -- 4: Time and Memory -- 4.1 Time in Artificial Systems -- 4.2 Bergson's Concept of Remembering -- 4.3 Summary -- References -- 5: Representation of Knowledge -- 5.1 Logic and Knowledge: Symbolic Representation -- Aristotle -- Enlightenment -- 5.2 Cognitive Revolution -- 5.3 The Heyday of AI -- 5.4 Cognitive Computing -- 5.5 Artificial Neural Networks -- References -- 6: Mnemonics -- 6.1 Summary -- References -- 7: The Art of Seeing -- 7.1 Art as Mental Gymnastics -- 7.2 Interaction of Art and Science -- Influence of Biological and Evolutionary Theory -- Influence of Freudian Psychoanalysis -- 7.3 The Viewer in the Focus of Art History -- 7.4 Images in the Brain and in AI -- Neurobiological Aspects of Perception -- Image Processing in AI -- What We Can Learn from the Brain -- 7.5 Summary -- References -- 8: Free Will -- 8.1 Free Will in Artificial Systems -- 8.2 Bergson's Intuition -- 8.3 From the Categorical Imperative to the Free Choice of Memory -- 8.4 The Libet Experiment -- 8.5 Summary -- References -- 9: Remembering: A Creative Act -- 9.1 Proust's Memories as a Process -- 9.2 Remembering in Neural Networks.
9.3 Remembering in Artificial Systems -- 9.4 Creativity in AI -- 9.5 Nabokov's Memory Patterns -- 9.6 Summary -- References -- 10: Frame and Structure -- 10.1 Framework in AI -- 10.2 Summary -- References -- 11: Consciousness -- 11.1 Qualia -- 11.2 The Role of the Body -- 11.3 The Theatre Model -- The Stage -- The Headlight -- The Actors -- The Context Behind the Scenes -- The Spectators -- 11.4 Consciousness in AI -- 11.5 Summary -- References -- 12: Language -- 12.1 Language in AI -- 12.2 Theories of Language in Linguistics -- 12.3 Summary -- References -- 13: Epilogue -- 13.1 The Blind and the Elephant. |
| Record Nr. | UNISA-996547950503316 |
|
Barthelmess Ulrike
|
||
| Wiesbaden, Germany : , : Springer, , [2023] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
KI 2005 : advances in artificial intelligence : 28th Annual German Conference on AI, KI 2005, Koblenz, Germany, September 11-14, 2005 : proceedings / / Ulrich Furbach (ed.)
| KI 2005 : advances in artificial intelligence : 28th Annual German Conference on AI, KI 2005, Koblenz, Germany, September 11-14, 2005 : proceedings / / Ulrich Furbach (ed.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (XIV, 418 p.) |
| Disciplina | 006.3 |
| Altri autori (Persone) | FurbachUlrich |
| Collana | Lecture notes in computer science,Lecture notes in artificial intelligence |
| Soggetto topico | Artificial intelligence |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Hierarchy in Fluid Construction Grammars -- Description Logics in Ontology Applications -- 175 Miles Through the Desert -- Knowledge Representation and Reasoning -- A New n-Ary Existential Quantifier in Description Logics -- Subsumption in w.r.t. Hybrid TBoxes -- Dependency Calculus: Reasoning in a General Point Relation Algebra -- Temporalizing Spatial Calculi: On Generalized Neighborhood Graphs -- Machine Learning -- Design of Geologic Structure Models with Case Based Reasoning -- Applying Constrained Linear Regression Models to Predict Interval-Valued Data -- On Utilizing Stochastic Learning Weak Estimators for Training and Classification of Patterns with Non-stationary Distributions -- Noise Robustness by Using Inverse Mutations -- Diagnosis -- Development of Flexible and Adaptable Fault Detection and Diagnosis Algorithm for Induction Motors Based on Self-organization of Feature Extraction -- Computing the Optimal Action Sequence by Niche Genetic Algorithm -- Diagnosis of Plan Execution and the Executing Agent -- Automatic Abstraction of Time-Varying System Models for Model Based Diagnosis -- Neural Networks -- Neuro-Fuzzy Kolmogorov’s Network for Time Series Prediction and Pattern Classification -- Design of Optimal Power Distribution Networks Using Multiobjective Genetic Algorithm -- New Stability Results for Delayed Neural Networks -- Planning -- Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date -- An Optimal Algorithm for Disassembly Scheduling with Assembly Product Structure -- Hybrid Planning Using Flexible Strategies -- Controlled Reachability Analysis in AI Planning: Theory and Practice -- Robotics -- Distributed Multi-robot Localization Based on Mutual Path Detection -- Modeling Moving Objects in a Dynamically Changing Robot Application -- Heuristic-Based Laser Scan Matching for Outdoor 6D SLAM -- A Probabilistic Multimodal Sensor Aggregation Scheme Applied for a Mobile Robot -- Behavior Recognition and Opponent Modeling for Adaptive Table Soccer Playing -- Cognitive Modelling / Philosophy / Natural Language -- Selecting What Is Important: Training Visual Attention -- Self-sustained Thought Processes in a Dense Associative Network -- Why Is the Lucas-Penrose Argument Invalid? -- On the Road to High-Quality POS-Tagging. |
| Altri titoli varianti |
Advances in artificial intelligence
28th Annual German Conference on AI Twenty-eighth Annual German Conference on AI German Conference on AI German Conference on Artificial Intelligence |
| Record Nr. | UNINA-9910484048403321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
KI 2005: Advances in Artificial Intelligence [[electronic resource] ] : 28th Annual German Conference on AI, KI 2005, Koblenz, Germany, September 11-14, 2005, Proceedings / / edited by Ulrich Furbach
| KI 2005: Advances in Artificial Intelligence [[electronic resource] ] : 28th Annual German Conference on AI, KI 2005, Koblenz, Germany, September 11-14, 2005, Proceedings / / edited by Ulrich Furbach |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XIV, 418 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Robotics Automation Artificial Intelligence Robotics and Automation |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Hierarchy in Fluid Construction Grammars -- Description Logics in Ontology Applications -- 175 Miles Through the Desert -- Knowledge Representation and Reasoning -- A New n-Ary Existential Quantifier in Description Logics -- Subsumption in w.r.t. Hybrid TBoxes -- Dependency Calculus: Reasoning in a General Point Relation Algebra -- Temporalizing Spatial Calculi: On Generalized Neighborhood Graphs -- Machine Learning -- Design of Geologic Structure Models with Case Based Reasoning -- Applying Constrained Linear Regression Models to Predict Interval-Valued Data -- On Utilizing Stochastic Learning Weak Estimators for Training and Classification of Patterns with Non-stationary Distributions -- Noise Robustness by Using Inverse Mutations -- Diagnosis -- Development of Flexible and Adaptable Fault Detection and Diagnosis Algorithm for Induction Motors Based on Self-organization of Feature Extraction -- Computing the Optimal Action Sequence by Niche Genetic Algorithm -- Diagnosis of Plan Execution and the Executing Agent -- Automatic Abstraction of Time-Varying System Models for Model Based Diagnosis -- Neural Networks -- Neuro-Fuzzy Kolmogorov’s Network for Time Series Prediction and Pattern Classification -- Design of Optimal Power Distribution Networks Using Multiobjective Genetic Algorithm -- New Stability Results for Delayed Neural Networks -- Planning -- Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date -- An Optimal Algorithm for Disassembly Scheduling with Assembly Product Structure -- Hybrid Planning Using Flexible Strategies -- Controlled Reachability Analysis in AI Planning: Theory and Practice -- Robotics -- Distributed Multi-robot Localization Based on Mutual Path Detection -- Modeling Moving Objects in a Dynamically Changing Robot Application -- Heuristic-Based Laser Scan Matching for Outdoor 6D SLAM -- A Probabilistic Multimodal Sensor Aggregation Scheme Applied for a Mobile Robot -- Behavior Recognition and Opponent Modeling for Adaptive Table Soccer Playing -- Cognitive Modelling / Philosophy / Natural Language -- Selecting What Is Important: Training Visual Attention -- Self-sustained Thought Processes in a Dense Associative Network -- Why Is the Lucas-Penrose Argument Invalid? -- On the Road to High-Quality POS-Tagging. |
| Record Nr. | UNISA-996465373203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic Programming and Nonmonotonic Reasoning [[electronic resource] ] : Fourth International Conference, LPNMR'97, Dagstuhl Castle, Germany, July 28-31, 1997, Proceedings / / edited by Ulrich Furbach, Anil Nerode
| Logic Programming and Nonmonotonic Reasoning [[electronic resource] ] : Fourth International Conference, LPNMR'97, Dagstuhl Castle, Germany, July 28-31, 1997, Proceedings / / edited by Ulrich Furbach, Anil Nerode |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XI, 461 p.) |
| Disciplina | 006.3/36 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Software engineering Architecture, Computer Mathematical logic Computer programming Artificial Intelligence Software Engineering/Programming and Operating Systems Computer System Implementation Mathematical Logic and Formal Languages Programming Techniques |
| ISBN | 3-540-69249-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Forward and backward chaining in constraint programming -- Strong and weak constraints in disjunctive datalog -- Nonmonotonic reasoning with quantified boolean constraints -- Improving the alternating fixpoint: The transformation approach -- Is non-monotonic reasoning always harder -- Complexity of only knowing: The prepositional case -- Affordable classes of normal logic programs -- Automated reasoning with nonmonotonic logics -- Simulations between programs as cellular automata -- Separating disbeliefs from beliefs in autoepistemic reasoning -- Power defaults (preliminary report) -- A study of Przymusinski's static semantics -- Resolution for skeptical stable semantics -- Computing non-ground representations of stable models -- Industry needs for integrated information services -- Computing, solving, proving: A report on the Theorema project -- Towards a systematic approach to representing knowledge in declarative logic programming -- A paraconsistent semantics with contradiction support detection -- On conservative enforced updates -- A general framework for revising nonmonotonic theories -- Composing general logic programs -- Modular logic programming and generalized quantifiers -- Programs with universally quantified embedded implications -- Generalized query answering in disjunctive deductive databases: Procedural and nonmonotonic aspects -- DisLoP: Towards a disjunctive logic programming system -- REVISE: Logic programming and diagnosis -- A deductive system for non-monotonic reasoning -- The deductive database system LOLA -- ACLP: Flexible solutions to complex problems -- Nonmonotonic reasoning in FLORID -- GLUE: Opening the world to theorem provers -- Smodels — an implementation of the stable model and well-founded semantics for normal logic programs -- XSB: A system for efficiently computing well-founded semantics -- An implementation platform for query-answering in default logics: The XRay system, its implementation and evaluation. |
| Record Nr. | UNISA-996465490403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic Programming and Nonmonotonic Reasoning [[electronic resource] ] : Fourth International Conference, LPNMR'97, Dagstuhl Castle, Germany, July 28-31, 1997, Proceedings / / edited by Ulrich Furbach, Anil Nerode
| Logic Programming and Nonmonotonic Reasoning [[electronic resource] ] : Fourth International Conference, LPNMR'97, Dagstuhl Castle, Germany, July 28-31, 1997, Proceedings / / edited by Ulrich Furbach, Anil Nerode |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XI, 461 p.) |
| Disciplina | 006.3/36 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Software engineering Computer architecture Logic, Symbolic and mathematical Computer programming Artificial Intelligence Software Engineering/Programming and Operating Systems Computer System Implementation Mathematical Logic and Formal Languages Programming Techniques |
| ISBN | 3-540-69249-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Forward and backward chaining in constraint programming -- Strong and weak constraints in disjunctive datalog -- Nonmonotonic reasoning with quantified boolean constraints -- Improving the alternating fixpoint: The transformation approach -- Is non-monotonic reasoning always harder -- Complexity of only knowing: The prepositional case -- Affordable classes of normal logic programs -- Automated reasoning with nonmonotonic logics -- Simulations between programs as cellular automata -- Separating disbeliefs from beliefs in autoepistemic reasoning -- Power defaults (preliminary report) -- A study of Przymusinski's static semantics -- Resolution for skeptical stable semantics -- Computing non-ground representations of stable models -- Industry needs for integrated information services -- Computing, solving, proving: A report on the Theorema project -- Towards a systematic approach to representing knowledge in declarative logic programming -- A paraconsistent semantics with contradiction support detection -- On conservative enforced updates -- A general framework for revising nonmonotonic theories -- Composing general logic programs -- Modular logic programming and generalized quantifiers -- Programs with universally quantified embedded implications -- Generalized query answering in disjunctive deductive databases: Procedural and nonmonotonic aspects -- DisLoP: Towards a disjunctive logic programming system -- REVISE: Logic programming and diagnosis -- A deductive system for non-monotonic reasoning -- The deductive database system LOLA -- ACLP: Flexible solutions to complex problems -- Nonmonotonic reasoning in FLORID -- GLUE: Opening the world to theorem provers -- Smodels — an implementation of the stable model and well-founded semantics for normal logic programs -- XSB: A system for efficiently computing well-founded semantics -- An implementation platform for query-answering in default logics: The XRay system, its implementation and evaluation. |
| Record Nr. | UNINA-9910144923703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
