Computational Logic — CL 2000 First International Conference London, UK, July 24–28, 2000 Proceedings
These are the proceedings of the First International Conference on Compu- tional Logic (CL 2000) which was held at Imperial College in London from 24th to 28th July, 2000. The theme of the conference covered all aspects of the theory, implementation, and application of computational logic, where com...
| Other Authors: | , , , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2000, 2000
|
| Edition: | 1st ed. 2000 |
| Series: | Lecture Notes in Artificial Intelligence
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- 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 RelationNets
- 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
- Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams
- Decidability Resultsfor 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
- 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
- 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
- Querying Inconsistent Databases: Algorithms and Implementation
- On Verification in Logic Database Languages
- Mining Minimal Non-redundant Association Rules UsingFrequent 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
- 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