This book constitutes the refereed proceedings of the 25th International Conference on Logic Programming, ICLP 2009, held in Pasadena, CA, USA, in July2009. The 29 revised full papers together with 9 short papers, 4 invited talks, 4 invited tutorials, and the abstracts of 18 doctoral consortium articles were carefully reviewed and selected from 69 initial submissions. The papers cover all issues of current research in logic programming, namely semantic foundations, formalisms, nonmonotonic reasoning, knowledge representation, compilation, memory management, virtual machines, parallelism, program analysis, program transformation, validation and verification, debugging, profiling, concurrency, objects, coordination, mobility, higher order, types, modes, programming techniques, abductive logic programming, answer set programming, constraint logic programming, inductive logic programming, alternative inference engines and mechanisms, deductive databases, data integration, software engineering, natural language, web tools, internet agents, artificial intelligence, bioinformatics.
Reihe
Auflage
Sprache
Verlagsort
Verlagsgruppe
Illustrationen
ISBN-13
978-3-642-02846-5 (9783642028465)
DOI
10.1007/978-3-642-02846-5
Schweitzer Klassifikation
Invited Talks.- Experiences Using Logic Programming in Bioinformatics.- A Knowledge Base System Project for FO(.).- From Plain Prolog to Logtalk Objects: Effective Code Encapsulation and Reuse.- Generative Modeling by PRISM.- Tutorials.- Enabling Serendipitous Search on the Web of Data Using Prolog.- Untangling Reverse Engineering with Logic and Abstraction.- (C)LP Tracing and Debugging.- Probabilistic Logic Learning - A Tutorial Abstract.- Best Papers.- Using Histograms to Better Answer Queries to Probabilistic Logic Programs.- Non-discriminating Arguments and Their Uses.- Applications I.- Preprocessing for Optimization of Probabilistic-Logic Models for Sequence Analysis.- Stabilization of Information Sharing for Queries Answering in Multiagent Systems.- Logic Programming for Multiagent Planning with Negotiation.- Implementation I.- Answer Set Programming with Constraints Using Lazy Grounding.- Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs.- Theory.- Modular Nonmonotonic Logic Programming Revisited.- Merging Logic Programs under Answer Set Semantics.- Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs.- Implementation II.- A Tabling Implementation Based on Variables with Multiple Bindings.- A Term-Based Global Trie for Tabled Logic Programs.- Analysis.- A New Approach to Non-termination Analysis of Logic Programs.- Constraints I.- Constraint Answer Set Solving.- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers.- System and Tool Descriptions.- A Language for Large Ensembles of Independently Executing Nodes.- Integrating Software Testing and Run-Time Checking in an Assertion Verification Framework.- Debugging for Model Expansion.- Applications II.- Metabolic Network Expansion with Answer Set Programming.- Answer Set Programming for Single-Player Games in General Game Playing.- Finding Similar or Diverse Solutions in Answer Set Programming.- Implementation III.- Attributed Data for CHR Indexing.- User Defined Indexing.- Constraints II.- Integration of Abductive Reasoning and Constraint Optimization in SCIFF.- Encoding Table Constraints in CLP(FD) Based on Pair-Wise AC.- Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming.- Probability, Uncertainty.- Logic Programming with Defaults and Argumentation Theories.- Qualified Computations in Functional Logic Programming.- Logic Programs under Three-Valued ?ukasiewicz Semantics.- Short Papers.- Execution Control for CHR.- Demand-Driven Normalisation for ACD Term Rewriting.- One More Decidable Class of Finitely Ground Programs.- Optimizing Compilation and Computational Complexity of Constraint Handling Rules.- Proving Termination by Invariance Relations.- Automating Termination Proofs for CHR.- An Overview of FORCES: An INRIA Project on Declarative Formalisms for Emergent Systems.- An Engine for Computing Well-Founded Models.- Incremental Answer Completion in the SLG-WAM.- Doctoral Consortium.- Research Summary: Tabled Evaluation for Transaction Logic Programs.- Research Summary: Logic Programming for Massively Distributed Systems.- Research Summary: Extending Elimination Algorithms for Functional Constraints to Solve Two Integer Variables per Inequality.- Research Summary.- Research Summary: Termination of CHR.- Research Summary: Intelligent Natural Language Processing Techniques and Tools.- Stochastic Reasoning with Models of Agent Behavior.- Research Summary.- Modular Action Language .- Answering Questionsfrom Natural Language Using A-Prolog.- Belief Logic Programming.- Logic-Statistic Models with Constraints for Biological Sequence Analysis.- Fusion of Logic Programming and Description Logics.- Research Summary: Non-termination Analysis of Logic Programs.- Study of Random Logic Programs.- Locally Distributed Predicates: A Programming Facility for Distributed State Detection.- Capturing Fair Computations on Concurrent Constraint Language.- Constraint Based Languages for Biological Reactions.
