Computational Logic — CL 2000

Syntax for Variable Binders: An Overview . . . . . . . . . . . . . . . . . . . . 239 Dale Miller Goal-Directed Proof Search in Multiple-Conclusioned Intuitionistic Logic . . 254 James Harland, Tatjana Lutovac, and Michael Winikoff Efficient EM Learning with Tabulation for Parameterized Logic Programs . 269 Yoshitaka Kameya and Taisuke Sato Model Generation Theorem Proving with Finite Interval Constraints . . . . . 285 Reiner Hähnle, Ryuzo Hasegawa, and Yasuyuki Shirai Combining Mobile Processes and Declarative Programming . . . . . . . . . . . . . 300 Rachid Echahed and Wendelin Serwe

[1]  Lawrence J. Henschen,et al.  Unit Refutations and Horn Sets , 1974, JACM.

[2]  Geneviève Simonet.  On Sandewall's Paper: Nonmonotonic Inference Rules for Multiple Inheritance with Exceptions , 1996, Artif. Intell..

[3]  I. V. Ramakrishnan,et al.  Efficient data structures for tabled resolution , 1997 .

[4]  David S. Touretzky,et al.  A Clash of Intuitions: The Current State of Nonmonotonic Multiple Inheritance Systems , 1987, IJCAI.

[5]  Roland Ducournau,et al.  On Stein's Paper: Resolving Ambiguity in Nonmonotonic Inheritance Hierarchies , 1994, Artif. Intell..

[6]  David Scott Warren,et al.  Attributed Variables in XSB , 1999, Electron. Notes Theor. Comput. Sci..

[7]  Thom W. Frühwirth,et al.  Compiling Constraint Handling Rules into Prolog with Attributed Variables , 1999, PPDP.

[8]  Maria Grazia Scutellà,et al.  A Note on Dowling and Gallier's Top-Down Algorithm for Propositional Horn Satisfiability , 1990, J. Log. Program..

[9]  Neil D. Jones,et al.  Complete problems for deterministic polynomial time , 1974, STOC '74.

[10]  David S. Touretzky,et al.  A Skeptic's Menagerie: Conflictors, Preemptors, Reinstaters, and Zombies in Nonrnonotonic Inheritance , 1991, IJCAI.

[11]  Michel Minoux,et al.  LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation , 1988, Inf. Process. Lett..

[12]  Grigori Mints,et al.  Gentzen-type systems and resolution rules. Part I. Propositional logic , 1990, Conference on Computer Logic.

[13]  Mukesh Dalal,et al.  Model-Theoretic Semantics and Tractable Algorithm for CNF-BCP , 1997, AAAI/IAAI.

[14]  Mark Johnson.  Memoization in Constraint Logic Programming , 1993, PPCP.

[15]  Anavai Ramesh.  Some applications of non clausal deduction , 1995 .

[16]  Fred S. Annexstein,et al.  On Finding Solutions for Extended Horn Formulas , 1995, Inf. Process. Lett..

[17]  David Toman.  Top-down Beats Bottom-up for Constraint Extensions of Datalog , 1995 .

[18]  Neil V. Murray,et al.  Dissolution: making paths vanish , 1993, JACM.

[19]  Christian Holzbaur.  Metastructures vs. Attributed Variables in the Context of Extensible Uniication | Applied for the Implementation of Clp Languages , 1992 .

[20]  Konstantinos Sagonas,et al.  XSB as an efficient deductive database engine , 1994, SIGMOD '94.

[21]  Hisao Tamaki,et al.  OLD Resolution with Tabulation , 1986, ICLP.

[22]  Johannes MatiasekAustrian.  A Clp Schema to Integrate Specialized Solvers and Its Application to Natural Language Processing , 1992 .

[23]  R. Fisher.  Mathematics of Inheritance , 1933, Nature.

[24]  Zbigniew Stachniak.  Polarity Guided Tractable Reasoning , 1999, AAAI/IAAI.

[25]  Harry R. Lewis,et al.  Renaming a Set of Clauses as a Horn Set , 1978, JACM.

[26]  Christian Holzbaur.  OFAI clp(Q,R) Manual , 1995 .

[27]  Zbigniew Stachniak.  Non-clausal Reasoning with Propositional Definite Theories , 1998, AISC.

[28]  Juliana Freire,et al.  The XSB Programmer's Manual Version 1.7.1 , 1994 .

[29]  Rakesh M. Verma,et al.  Symbolic Bisimulation using Tabled Constraint Logic Programming , 2000 .

[30]  Serge Le Huitouze.  A New Data Structure for Implementing Extensions to Prolog , 1990, PLILP.