12. ICLP 1995: Tokyo, Japan

Invited Talks

• Kenneth M. Kahn: ToonTalk - Concurrent Constraint Programming for Kids. 3

Advanced Tutorials

• Ryuzo Hasegawa: Model Generation Theorem Provers and Their Applications. 7
• Helmut Simonis: Applications of Constraint Logic Programming. 9-11
• Gert Smolka: Oz: Concurrent Constraint Programming for Real. 13

Constraints I

• C. K. Chiu, J. H. M. Lee: Interval Linear Constraint Solving Using the Preconditioned Interval Gauss-Seidel Method. 17-31
• Jennifer Burg, Peter J. Stuckey, Jason C. H. Tai, Roland H. C. Yap: Linear Equation Solving for Constraint Logic Programming. 33-47
• Nevin Heintze, Joxan Jaffar: A Generic Algorithm for CLP Analysis. 49-63

Representing Actions in Logic Programming

• Fariba Sadri, Robert A. Kowalski: Variants of the Event Calculus. 67-81
• Kristof Van Belleghem, Marc Denecker, Danny De Schreye: Combining Situation Calculus and Event Calculus. 83-97
• Suryanarayana M. Sripada: Efficient Implementation of the Event Calculus for Temporal Database Applications. 99-113

Constraints II

• Björn Carlson, Mats Carlsson: Compiling and Executing Disjunctions of Finite Domain Constraints. 117-131
• Peter Barth, Alexander Bockmayr: Finite Domain and Cutting Plane Techniques in CLP(PB). 133-147
• François Fages, Julian Fowler, Thierry Sola: A Reactive Constraint Logic Programming Scheme. 149-163

Databases

• Li-Yan Yuan, Jia-Huai You: On Coherence Approach to Logic Program Revision. 167-181
• Michael I. Dekhtyar, Alexander Ja. Dikovsky: Dynamic Deductive Data Bases With Steady Behaviour. 183-197
• Stefan Brass, Jürgen Dix: Disjunctive Semantics based upon Partial and Bottom-Up Evaluation. 199-213

Applications

• Neng-Fa Zhou: A Logic Programming Approach to Channel Routing. 217-231
• V. S. Subrahmanian, Carlo Zaniolo: Relating Stable Models and AI Planning Domains. 233-247
• Yasuyuki Shirai, Ryuzo Hasegawa: Two Approaches for Finite-Domain Constraint Satisfaction Problems - CP and CMGTP. 249-263

Nonmonotonic Reasoning

• Pawel Cholewinski, V. Wiktor Marek, Artur Mikitiuk, Miroslaw Truszczynski: Experimenting with Nonmonotonic Reasoning. 267-281
• Toshiko Wakaki, Ken Satoh: Computing Prioritized Circumscription by Logic Programming. 283-297
• Iliano Cervesato, Luca Chittaro, Angelo Montanari: A Modal Calculus of Partially Ordered Events in a Logic Programming Framework. 299-313

Compiling

• Philippe Codognet, Daniel Diaz: WAMCC: Compiling Prolog to C. 317-331
• Andreas Krall, Thomas Berger: Incremental Global Compilation of Prolog with the Vienna Abstract Machine. 333-347
• Konstantinos F. Sagonas, David Scott Warren: Efficient Execution of HiLog in WAM-based Prolog Implementations. 349-363

Abduction

• Francesca Toni, Robert A. Kowalski: Reduction of Abductive Logic Programs to Normal Logic Programs. 367-381
• Chiaki Sakama, Katsumi Inoue: The Effect of Partial Deduction in Abductive Reasoning. 383-397
• Antonis C. Kakas, A. Michael: Integrating Abductive and Constraint Logic Programming. 399-413

CC Languages

• Philippe Codognet, Francesca Rossi: NMCC Programming: Constraint Enforcement and Retracting in CC Programming. 417-431
• Per Brand: A Decision Graph Algorithm for CCP Languages. 433-447
• Andreas Podelski, Gert Smolka: Operational Semantics of Constraint Logic Programs with Coroutining. 449-463

Programming Techniques

• Timothy S. Gegg-Harrison: Representing Logic Program Schemata in lambda-Prolog. 467-481
• Ashish Jain: Projections of Logic Programs using Symbol Mappings. 483-496
• Mantis H. M. Cheng, Douglas Stott Parker Jr., Maarten H. van Emden: A Method for Implementing Equational Theories as Logic Programs. 497-511

Concurrency

• Steve Gregory, Rafael Ramirez: Tempo: A Declarative Concurrent Programming Language. 515-529
• Jean-Marie Jacquet, Koenraad De Bosschere: On Composing Concurrent Logic Processes. 531-545
• Roberto Barbuti, Nicoletta De Francesco, Antonella Santone: Modeling OR-Parallel Execution of Prolog using CHOCS. 547-561

Theory

• Anatoli Degtyarev, Andrei Voronkov: A New Procedural Interpretation of Horn Clauses with Equality. 565-579
• Vladimir Lifschitz: SLDNF, Constructive Negation and Grounding. 581-595
• Bern Martens, John P. Gallagher: Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance. 597-611

Parallel Implementation

• Enrico Pontelli, Gopal Gupta, Dongxing Tang: Determinacy Driven Optimizations of And-Parallel Prolog Implementations. 615-629
• Manuel V. Hermenegildo, Daniel Cabeza Gras, Manuel Carro: Using Attributed Variables in the Implementation of Concurrent and Parallel Logic Programming Systems. 631-645
• Manuel V. Hermenegildo, Pedro López-García: Efficient Term Size Computation for Granularity Control. 647-661

Program Manipulation

• Michael Hanus: On Extra Variables in (Equational) Logic Programming. 665-679
• Sandro Etalle, Maurizio Gabbrielli: A Transformation System for Modular CLP Programs. 681-695
• I. V. Ramakrishnan, Prasad Rao, Konstantinos F. Sagonas, Terrance Swift, David Scott Warren: Efficient Tabling Mechanisms for Logic Programs. 697-711

Novel Formalisms

• Taisuke Sato: A Statistical Learning Method for Logic Programs with Distribution Semantics. 715-729
• Kannan Govindarajan, Bharat Jayaraman, Surya Mantha: Preference Logic Programming. 731-745
• Johan Boye, Jan Maluszynski: Two Aspects of Directional Types. 747-761

Program Analysis

• Christoph Beierle: Type Inferencing for Polymorphic Order-Sorted Logic Programs. 765-779
• Anne Mulkers, Wim Simoens, Gerda Janssens, Maurice Bruynooghe: On the Practicality of Abstract Equation Systems. 781-795
• Manuel V. Hermenegildo, Germán Puebla, Kim Marriott, Peter J. Stuckey: Incremental Analysis of Logic Programs. 797-811

Poster Abstracts

• Ilyas Cicekli: Shallow Backtracking Points in an Intelligent Backtracking Schema. 815
• Bogumil Hausman: Hybrid Implementation Techniques in Erlang BEAM. 816
• T. H. Fung: Abduction with Clark Completion. 817
• Keiji Hirata: Proving Correctness of Translation from Moded Flat GHC to Pi-Calculus. 818
• Anna Formica, Michele Missikoff, Roberto Terenzi: A Theorem Prover for Checking Satisfiability of Object-Oriented Database Schemas. 819
• Yuka Shimajiri, Hirohisa Seki, Hidenori Itoh: Making Query Processing Goal-Directed in Disjunctive Logic Databases. 820
• Hans Nilsson, Torbjörn Törnkvist, Claes Wikstrom: Amnesia - A Distributed Real-Time Primary Memory DBMS with a Deductive Query Language. 821
• Hideki Isozaki, Hirofumi Katsuno: Transformation of Transaction Logic Programs based on Estimation of Transaction Execution Paths. 822
• Jichang Tan, I-Peng Lin: Type Synthesis for Logic Programs. 823
• Gopal Gupta, Vítor Santos Costa, Enrico Pontelli: Shared Paged Binding Array: A Universal Datastructure for Parallel Logic Programming. 824
• Jianjun Zhao, Jingde Cheng, Kazuo Ushijima: Program Dependence Analysis of Concurrent Logic Programs and Its Applications. 825
• Andreas Podelski, Gert Smolka: Situated Simplification. 826
• Jørgen Fischer Nilsson, Andreas Hamfelt: Constructing Logic Programs with Higher-Order Predicates. 827
• Dan Sahlin, Thomas Sjöland: An Analyzer for a Concurrent Constraint Language. 828
• Juan José Moreno-Navarro: Tuple Inheritance: A New Kind of Inheritance for (Constraint) Logic Programming. 829
• Jonas Barklund, Pierangelo Dell'Acqua, Stefania Costantini, Gaetano Aurelio Lanzarone: Semantical Properties of SLD-Resolution with Reflection. 830

Last update Thu May 23 17:05:53 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page