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 |
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 | ||
|
Functional and Logic Programming [[electronic resource] ] : 7th International Symposium, FLOPS 2004, Nara, Japan, April 7-9, 2004, Proceedings / / edited by Yukiyoshi Kameyama, Peter J. Stuckey |
Edizione | [1st ed. 2004.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
Descrizione fisica | 1 online resource (X, 307 p.) |
Disciplina | 005.1/14 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer programming
Programming languages (Electronic computers) Computer logic Artificial intelligence Programming Techniques Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Artificial Intelligence |
ISBN |
1-280-30803-6
9786610308033 3-540-24754-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- A Brief Survey of Quantum Programming Languages -- Analysis of Synchronous and Asynchronous Cellular Automata Using Abstraction by Temporal Logic -- Twelf and Delphin: Logic and Functional Programming in a Meta-logical Framework -- Refereed Papers Logic and Functional-Logic Programming -- Online Justification for Tabled Logic Programs -- Constructive Intensional Negation -- Analysing Definitional Trees: Looking for Determinism -- Applications -- : a Declarative Debugging Tool for Functional-Logic Languages -- LIX: an Effective Self-applicable Partial Evaluator for Prolog -- Program Analysis -- Multivariant Non-failure Analysis via Standard Abstract Interpretation -- Set-Sharing Is Not Always Redundant for Pair-Sharing -- Backward Pair Sharing Analysis -- Rewriting -- Implementing Natural Rewriting and Narrowing Efficiently -- Complete Axiomatization of an Algebraic Construction of Graphs -- Sub-Birkhoff -- Types and Modules -- Relaxing the Value Restriction -- Rigid Mixin Modules -- Logic and Semantics -- Semantics of Linear Continuation-Passing in Call-by-Name -- A Direct Proof of Strong Normalization for an Extended Herbelin’s Calculus -- Functional Programming -- Normalization by Evaluation for ? ?2 -- Basic Pattern Matching Calculi: a Fresh View on Matching Failure -- Derivation of Deterministic Inverse Programs Based on LR Parsing. |
Record Nr. | UNISA-996465565003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Functional and Logic Programming : 7th International Symposium, FLOPS 2004, Nara, Japan, April 7-9, 2004, Proceedings / / edited by Yukiyoshi Kameyama, Peter J. Stuckey |
Edizione | [1st ed. 2004.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
Descrizione fisica | 1 online resource (X, 307 p.) |
Disciplina | 005.1/14 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer programming
Programming languages (Electronic computers) Computer logic Artificial intelligence Programming Techniques Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Artificial Intelligence |
ISBN |
1-280-30803-6
9786610308033 3-540-24754-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- A Brief Survey of Quantum Programming Languages -- Analysis of Synchronous and Asynchronous Cellular Automata Using Abstraction by Temporal Logic -- Twelf and Delphin: Logic and Functional Programming in a Meta-logical Framework -- Refereed Papers Logic and Functional-Logic Programming -- Online Justification for Tabled Logic Programs -- Constructive Intensional Negation -- Analysing Definitional Trees: Looking for Determinism -- Applications -- : a Declarative Debugging Tool for Functional-Logic Languages -- LIX: an Effective Self-applicable Partial Evaluator for Prolog -- Program Analysis -- Multivariant Non-failure Analysis via Standard Abstract Interpretation -- Set-Sharing Is Not Always Redundant for Pair-Sharing -- Backward Pair Sharing Analysis -- Rewriting -- Implementing Natural Rewriting and Narrowing Efficiently -- Complete Axiomatization of an Algebraic Construction of Graphs -- Sub-Birkhoff -- Types and Modules -- Relaxing the Value Restriction -- Rigid Mixin Modules -- Logic and Semantics -- Semantics of Linear Continuation-Passing in Call-by-Name -- A Direct Proof of Strong Normalization for an Extended Herbelin’s Calculus -- Functional Programming -- Normalization by Evaluation for ? ?2 -- Basic Pattern Matching Calculi: a Fresh View on Matching Failure -- Derivation of Deterministic Inverse Programs Based on LR Parsing. |
Record Nr. | UNINA-9910144195103321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Logic Programming [[electronic resource] ] : 18th International Conference, ICLP 2002, Copenhagen, Denmark, July 29 - August 1, 2002 Proceedings / / edited by Peter J. Stuckey |
Edizione | [1st ed. 2002.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Descrizione fisica | 1 online resource (XI, 486 p.) |
Disciplina | 003.3 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Architecture, Computer
Software engineering Mathematical logic Artificial intelligence Computer programming Programming languages (Electronic computers) Computer System Implementation Software Engineering/Programming and Operating Systems Mathematical Logic and Foundations Artificial Intelligence Programming Techniques Programming Languages, Compilers, Interpreters |
ISBN | 3-540-45619-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Speakers -- Representing Arithmetic Constraints with Finite Automata: An Overview -- Logic Databases on the Semantic Web: Challenges and Opportunities -- Conference Papers -- An Abductive Approach for Analysing Event-Based Requirements Specifications -- Trailing Analysis for HAL -- Access Control for Deductive Databases by Logic Programming -- Reasoning about Actions with CHRs and Finite Domain Constraints -- Using Hybrid Concurrent Constraint Programming to Model Dynamic Biological Systems -- Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints -- Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP -- A Model Theoretic Semantics for Multi-level Secure Deductive Databases -- Propagation Completeness of Reactive Constraints -- On Enabling the WAM with Region Support -- A Different Look at Garbage Collection for the WAM -- Copying Garbage Collection for the WAM: To Mark or Not to Mark? -- Logical Algorithms -- Logical Loops -- Learning in Logic with RichProlog -- Towards a Declarative Query and Transformation Language for XML and Semistructured Data: Simulation Unification -- A Proof-Theoretic Foundation for Tabled Higher-Order Logic Programming -- Proving the Equivalence of CLP Programs -- A Purely Logical Account of Sequentiality in Proof Search -- Disjunctive Explanations -- Reasoning with Infinite Stable Models II: Disjunctive Programs -- Computing Stable Models: Worst-Case Performance Estimates -- Towards Local Search for Answer Sets -- A Rewriting Method for Well-Founded Semantics with Explicit Negation -- Embedding Defeasible Logic into Logic Programs -- A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report -- Using Logic Programming to Detect Activities in Pervasive Healthcare -- Logic Programming for Software Engineering: A Second Chance -- A Logic-Based System for Application Integration -- Conference Papers -- The Limits of Horn Logic Programs -- Multi-adjoint Logic Programming: A Neural Net Approach -- Fuzzy Prolog: A Simple General Implementation Using CLP( ) -- Automated Analysis of CLP(FD) Program Execution Traces -- Schema-Based Transformations of Logic Programs in ?Prolog -- Non-uniform Hypothesis in Deductive Databases with Uncertainty -- Probabilistic Finite Domains: A Brief Overview -- Modelling Multi-agent Reactive Systems -- Integrating Planning, Action Execution, Knowledge Updates and Plan Modifications via Logic Programming -- A Logic Program Characterization of Domain Reduction Approximations in Finite Domain CSPs -- TCLP: Overloading, Subtyping and Parametric Polymorphism Made Practical for CLP -- Logical Grammars Based on Constraint Handling Rules -- Debugging in A-Prolog: A Logical Approach. |
Record Nr. | UNISA-996466366303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Logic Programming : 18th International Conference, ICLP 2002, Copenhagen, Denmark, July 29 - August 1, 2002 Proceedings / / edited by Peter J. Stuckey |
Edizione | [1st ed. 2002.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Descrizione fisica | 1 online resource (XI, 486 p.) |
Disciplina | 003.3 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Architecture, Computer
Software engineering Mathematical logic Artificial intelligence Computer programming Programming languages (Electronic computers) Computer System Implementation Software Engineering/Programming and Operating Systems Mathematical Logic and Foundations Artificial Intelligence Programming Techniques Programming Languages, Compilers, Interpreters |
ISBN | 3-540-45619-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Speakers -- Representing Arithmetic Constraints with Finite Automata: An Overview -- Logic Databases on the Semantic Web: Challenges and Opportunities -- Conference Papers -- An Abductive Approach for Analysing Event-Based Requirements Specifications -- Trailing Analysis for HAL -- Access Control for Deductive Databases by Logic Programming -- Reasoning about Actions with CHRs and Finite Domain Constraints -- Using Hybrid Concurrent Constraint Programming to Model Dynamic Biological Systems -- Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints -- Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP -- A Model Theoretic Semantics for Multi-level Secure Deductive Databases -- Propagation Completeness of Reactive Constraints -- On Enabling the WAM with Region Support -- A Different Look at Garbage Collection for the WAM -- Copying Garbage Collection for the WAM: To Mark or Not to Mark? -- Logical Algorithms -- Logical Loops -- Learning in Logic with RichProlog -- Towards a Declarative Query and Transformation Language for XML and Semistructured Data: Simulation Unification -- A Proof-Theoretic Foundation for Tabled Higher-Order Logic Programming -- Proving the Equivalence of CLP Programs -- A Purely Logical Account of Sequentiality in Proof Search -- Disjunctive Explanations -- Reasoning with Infinite Stable Models II: Disjunctive Programs -- Computing Stable Models: Worst-Case Performance Estimates -- Towards Local Search for Answer Sets -- A Rewriting Method for Well-Founded Semantics with Explicit Negation -- Embedding Defeasible Logic into Logic Programs -- A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report -- Using Logic Programming to Detect Activities in Pervasive Healthcare -- Logic Programming for Software Engineering: A Second Chance -- A Logic-Based System for Application Integration -- Conference Papers -- The Limits of Horn Logic Programs -- Multi-adjoint Logic Programming: A Neural Net Approach -- Fuzzy Prolog: A Simple General Implementation Using CLP( ) -- Automated Analysis of CLP(FD) Program Execution Traces -- Schema-Based Transformations of Logic Programs in ?Prolog -- Non-uniform Hypothesis in Deductive Databases with Uncertainty -- Probabilistic Finite Domains: A Brief Overview -- Modelling Multi-agent Reactive Systems -- Integrating Planning, Action Execution, Knowledge Updates and Plan Modifications via Logic Programming -- A Logic Program Characterization of Domain Reduction Approximations in Finite Domain CSPs -- TCLP: Overloading, Subtyping and Parametric Polymorphism Made Practical for CLP -- Logical Grammars Based on Constraint Handling Rules -- Debugging in A-Prolog: A Logical Approach. |
Record Nr. | UNINA-9910143881803321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Logic-Based Program Synthesis and Transformation [[electronic resource] ] : 28th International Symposium, LOPSTR 2018, Frankfurt/Main, Germany, September 4-6, 2018, Revised Selected Papers / / edited by Fred Mesnard, Peter J. Stuckey |
Edizione | [1st ed. 2019.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
Descrizione fisica | 1 online resource (XX, 203 p. 565 illus., 4 illus. in color.) |
Disciplina | 005.115 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Software engineering Compilers (Computer programs) Computer programming Artificial intelligence Machine theory Computer Science Logic and Foundations of Programming Software Engineering Compilers and Interpreters Programming Techniques Artificial Intelligence Formal Languages and Automata Theory |
ISBN | 3-030-13838-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Analysis of term rewriting -- Logic-based distributed/concurrent programming -- Analysis of logic programming -- Program analysis. |
Record Nr. | UNISA-996466437303316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Logic-Based Program Synthesis and Transformation : 28th International Symposium, LOPSTR 2018, Frankfurt/Main, Germany, September 4-6, 2018, Revised Selected Papers / / edited by Fred Mesnard, Peter J. Stuckey |
Edizione | [1st ed. 2019.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
Descrizione fisica | 1 online resource (XX, 203 p. 565 illus., 4 illus. in color.) |
Disciplina | 005.115 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Software engineering Compilers (Computer programs) Computer programming Artificial intelligence Machine theory Computer Science Logic and Foundations of Programming Software Engineering Compilers and Interpreters Programming Techniques Artificial Intelligence Formal Languages and Automata Theory |
ISBN | 3-030-13838-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Analysis of term rewriting -- Logic-based distributed/concurrent programming -- Analysis of logic programming -- Program analysis. |
Record Nr. | UNINA-9910337582303321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|