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.
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 | ||
| ||
Logics in Artificial Intelligence [[electronic resource] ] : European Workshop, JELIA 2000 Malaga, Spain, September 29 - October 2, 2000 Proceedings / / edited by Manuel Ojeda-Aciego, Inma P. de Guzman, Gerhard Brewka, Luis M. Pereira
| Logics in Artificial Intelligence [[electronic resource] ] : European Workshop, JELIA 2000 Malaga, Spain, September 29 - October 2, 2000 Proceedings / / edited by Manuel Ojeda-Aciego, Inma P. de Guzman, Gerhard Brewka, Luis M. Pereira |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XII, 412 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Programming languages (Electronic computers) Mathematical logic Computer programming Artificial Intelligence Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages Programming Techniques |
| ISBN | 3-540-40006-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- ‘On Being Informed’: Update Logics for Knowledge States -- Considerations on Updates of Logic Programs -- The Approach: Integrating Object Oriented Design and Formal Verification -- Semi-qualitative Reasoning about Distances: A Preliminary Report -- Regular Contributions -- Hybrid Probabilistic Logic Programs as Residuated Logic Programs -- Topo-distance: Measuring the Difference between Spatial Patterns -- An Abductive Mechanism for Natural Language Processing Based on Lambek Calculus -- Capturing Stationary and Regular Extensions with Reiter’s Extensions -- Representing the Process Semantics in the Event Calculus -- Declarative Formalization of Strategies for Action Selection: Applications to Planning -- An Algorithmic Approach to Recover Inconsistent Knowledge-Bases -- Acceptance Without Minimality -- Reduction Theorems for Boolean Formulas Using ?-Trees -- Simultaneous Rigid Sorted Unification -- Partially Adaptive Code Trees -- On Dialogue Systems with Speech Acts, Arguments, and Counterarguments -- Credulous and Sceptical Argument Games for Preferred Semantics -- A General Approach to Multi-agent Minimal Knowledge -- A Modal Logic for Network Topologies -- Avoiding Logical Omniscience by Using Subjective Situations -- Multi-agent Logic -- New Tractable Cases in Default Reasoning from Conditional Knowledge Bases -- Monodic Epistemic Predicate Logic -- Updates plus Preferences -- A Framework for Belief Update -- A Compilation of Brewka and Eiter’s Approach to Prioritization -- A Logic for Modeling Decision Making with Dynamic Preferences. |
| Record Nr. | UNISA-996466193903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logics in Artificial Intelligence : European Workshop, JELIA 2000 Malaga, Spain, September 29 - October 2, 2000 Proceedings / / edited by Manuel Ojeda-Aciego, Inma P. de Guzman, Gerhard Brewka, Luis M. Pereira
| Logics in Artificial Intelligence : European Workshop, JELIA 2000 Malaga, Spain, September 29 - October 2, 2000 Proceedings / / edited by Manuel Ojeda-Aciego, Inma P. de Guzman, Gerhard Brewka, Luis M. Pereira |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XII, 412 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Programming languages (Electronic computers) Mathematical logic Computer programming Artificial Intelligence Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages Programming Techniques |
| ISBN | 3-540-40006-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- ‘On Being Informed’: Update Logics for Knowledge States -- Considerations on Updates of Logic Programs -- The Approach: Integrating Object Oriented Design and Formal Verification -- Semi-qualitative Reasoning about Distances: A Preliminary Report -- Regular Contributions -- Hybrid Probabilistic Logic Programs as Residuated Logic Programs -- Topo-distance: Measuring the Difference between Spatial Patterns -- An Abductive Mechanism for Natural Language Processing Based on Lambek Calculus -- Capturing Stationary and Regular Extensions with Reiter’s Extensions -- Representing the Process Semantics in the Event Calculus -- Declarative Formalization of Strategies for Action Selection: Applications to Planning -- An Algorithmic Approach to Recover Inconsistent Knowledge-Bases -- Acceptance Without Minimality -- Reduction Theorems for Boolean Formulas Using ?-Trees -- Simultaneous Rigid Sorted Unification -- Partially Adaptive Code Trees -- On Dialogue Systems with Speech Acts, Arguments, and Counterarguments -- Credulous and Sceptical Argument Games for Preferred Semantics -- A General Approach to Multi-agent Minimal Knowledge -- A Modal Logic for Network Topologies -- Avoiding Logical Omniscience by Using Subjective Situations -- Multi-agent Logic -- New Tractable Cases in Default Reasoning from Conditional Knowledge Bases -- Monodic Epistemic Predicate Logic -- Updates plus Preferences -- A Framework for Belief Update -- A Compilation of Brewka and Eiter’s Approach to Prioritization -- A Logic for Modeling Decision Making with Dynamic Preferences. |
| Record Nr. | UNINA-9910208853103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logics in Artificial Intelligence [[electronic resource] ] : European Workshop JELIA '94, York, UK, September 5-8, 1994. Proceedings / / edited by Craig MacNish, David Pearce, Luis M. Pereira
| Logics in Artificial Intelligence [[electronic resource] ] : European Workshop JELIA '94, York, UK, September 5-8, 1994. Proceedings / / edited by Craig MacNish, David Pearce, Luis M. Pereira |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (IX, 416 p.) |
| Disciplina | 006.3/01/5113 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs |
| ISBN | 3-540-48657-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | From Carnap's modal logic to autoepistemic logic -- Compactness properties of nonmonotonic inference operations -- Around a powerful property of circumscriptions -- The computational value of joint consistency -- Belief dynamics, abduction, and databases -- On the logic of theory base change -- Belief, provability, and logic programs -- Revision specifications by means of programs -- Revision of non-monotonic theories -- A complete connection calculus with rigid E-unification -- Equality and constrained resolution -- Efficient strategies for Automated reasoning in modal logics -- TAS-D++: Syntactic trees transformations for Automated Theorem Proving -- A unification of ordering refinements of resolution in classical logic -- Two logical dimensions -- Prioritized autoepistemic logic -- Adding priorities and specificity to default logic -- Viewing hypothesis theories as constrained graded theories -- Temporal theories of reasoning -- Reasoning about knowledge on computation trees -- Prepositional state event logic -- Description Logics with inverse roles, functional restrictions, and n-ary relations -- On the concept of generic object: A nonmonotonic reasoning approach and examples -- Autoepistemic logic of minimal beliefs -- How to use modalities and sorts in Prolog -- Towards resource handling in logic programming: The PPL framework and its semantics -- Extending Horn clause theories by reflection principles. |
| Record Nr. | UNISA-996466097003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||