BibSLEIGH — prolog tag

prolog

prolog

Tag #prolog

547 papers:

PADL-2020-TarauB #graph #interactive #mining: Interactive Text Graph Mining with a Prolog-based Dialog Engine (PT, EB0), pp. 3–19.
ICFP-2018-StampoulisC #functional #higher-order #learning #logic programming #prototype #using: Prototyping a functional language using higher-order logic programming: a functional pearl on learning the ways of λProlog/Makam (AS, AC), p. 30.
PPDP-2018-NogatzKS #definite clause grammar #using #visualisation: Web-based Visualisation for Definite Clause Grammars Using Prolog Meta-Interpreters: System Description (FN, JK, DS), p. 10.
PPDP-2017-AngelopoulosW #biology: Accessing biological data as Prolog facts (NA, JW), pp. 29–38.
TAP-2016-CheneyMP #roadmap #testing: Advances in Property-Based Testing for α Prolog (JC, AM, MP), pp. 37–56.
SAC-2015-DymchenkoM #eclipse #problem: Declaratively solving tricky google code jam problems with prolog-based ECLiPSe CLP system (SD, MM), pp. 2122–2124.
ICLP-2015-RoseckyPB #energy #grid #simulation: Grid Mind: Prolog-Based Simulation Environment for Future Energy Grids (JR, FP, BB), pp. 18–31.
FLOPS-2014-AmaralFC #named #testing: PrologCheck — Property-Based Testing in Prolog (CA, MF, VSC), pp. 1–17.
FLOPS-2014-KrienerK #revisited #semantics: Semantics for Prolog with Cut — Revisited (JK, AK), pp. 270–284.
ILC-2014-Nunes-Harwitt #compilation: From Naïve to Norvig On Deriving a PROLOG Compiler (ANH), p. 70.
CIG-2014-SwiechowskiM #game studies #logic: Prolog versus specialized logic inference engine in General Game Playing (MS, JM), pp. 1–8.
LOPSTR-2014-MoralesH: Pre-indexed Terms for Prolog (JFM, MVH), pp. 317–331.
LOPSTR-2014-Vidal #execution #generative #testing: Concolic Execution and Test Case Generation in Prolog (GV), pp. 167–181.
PADL-2014-SonPL #multi #source code: Two Applications of the ASP-Prolog System: Decomposable Programs and Multi-context Systems (TCS, EP, TL), pp. 87–103.
SEKE-2013-Al-JamimiA #design pattern #detection #using: Using Prolog Rules to Detect Software Design Patterns: Strengths and Weaknesses (HAAJ, MAA), pp. 727–730.
PADL-2013-CanisiusAW #database #interface #named: proSQLite: Prolog File Based Databases via an SQLite Interface (SC, NA, LW), pp. 222–227.
PPDP-2013-Corte-RealDR #parallel #programming: Prolog programming with a map-reduce parallel construct (JCR, IdCD, RR), pp. 285–296.
PPDP-2013-KrienerKB #coq #proving #semantics: Proofs you can believe in: proving equivalences between Prolog semantics in Coq (JK, AK, SB), pp. 37–48.
SAC-PL-J-2012-Ancona13 #recursion: Regular corecursion in Prolog (DA), pp. 142–162.
ICLP-J-2013-JansenJJ #compilation #induction: Compiling Input* FO(·) inductive definitions into tabled prolog rules for IDP3 (JJ, AJ, GJ), pp. 691–704.
ICLP-J-2013-SchrijversDDW #continuation: Delimited continuations for prolog (TS, BD, BD, JW), pp. 533–546.
ICLP-J-2013-Tarau: Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and Gödel numberings) (PT), pp. 847–861.
TFPIE-2012-StutterheimSS #declarative #education #programming: Forty hours of declarative programming: Teaching Prolog at the Junior College Utrecht (JS, WS, SDS), pp. 50–62.
FLOPS-2012-Triska #constraints #finite #theorem proving: The Finite Domain Constraint Solver of SWI-Prolog (MT), pp. 307–316.
SAC-2012-Ancona #recursion: Regular corecursion in Prolog (DA), pp. 1897–1902.
ICLP-2012-Hadjichristodoulou #polymorphism #type system: A Gradual Polymorphic Type System with Subtyping for Prolog (SH), pp. 451–457.
LOPSTR-2011-StroderESGF #analysis #complexity #linear #semantics #termination: A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog (TS, FE, PSK, JG, CF), pp. 237–252.
PADL-2011-WielemakerC #on the: On the Portability of Prolog Applications (JW, VSC), pp. 69–83.
ISMM-2011-Tarau #memory management #multi: Integrated symbol table, engine and heap memory management in multi-engine prolog (PT), pp. 129–138.
ICLP-2011-DovierFP #coordination #named: BAAC: A Prolog System for Action Description and Agents Coordination (AD, AF, EP), pp. 187–197.
ICLP-2011-Eichberg #compilation #java: Compiling Prolog to Idiomatic Java (ME), pp. 84–94.
ICLP-2011-ZomboriCS #functional #static typing #type checking: Static Type Checking for the Q Functional Language in Prolog (ZZ, JC, PS), pp. 62–72.
ICLP-J-2011-DrescherT #logic programming #named: ALPprolog — A new logic programming method for dynamic domains (CD, MT), pp. 451–468.
ICLP-J-2011-KrienerK #named: RedAlert: Determinacy inference for Prolog (JK, AK), pp. 537–553.
ICLP-J-2011-Porto #composition #semantics: A structured alternative to Prolog with simple compositional semantics (AP), pp. 611–627.
FLOPS-2010-HoweK #satisfiability: A Pearl on SAT Solving in Prolog (JMH, AK), pp. 165–174.
PADL-2010-SridharH #monitoring: ActionScript In-Lined Reference Monitoring in Prolog (MS, KWH), pp. 149–151.
PPDP-2010-BolzLS #execution #towards #virtual machine: Towards a jitting VM for prolog execution (CFB, ML, DS), pp. 99–108.
ICLP-2010-SantosM10 #named: Subsumer: A Prolog theta-subsumption engine (JS, SM), pp. 172–181.
ICLP-J-2010-LopesNRS #distributed: Applying Prolog to develop distributed systems (NPL, JANP, AR, AS), pp. 691–707.
ITiCSE-2009-Mohr #novel: Two novel prolog assignments (JM), p. 350.
LOPSTR-2009-BolzLR #partial evaluation #towards: Towards Just-In-Time Partial Evaluation of Prolog (CFB, ML, AR), pp. 158–172.
PADL-2009-SuleimanM #concurrent #implementation #parallel #thread: Implementing Thread Cancellation in Multithreaded Prolog Systems (AS, JM), pp. 122–136.
PPDP-2009-IranzoR #declarative #semantics: A declarative semantics for Bousi~Prolog (PJI, CRM), pp. 149–160.
PPDP-2009-Lammel #exclamation #scrap your boilerplate: Scrap your boilerplate: prologically! (RL), pp. 7–12.
ICLP-2009-Moura #effectiveness #encapsulation #reuse: From Plain Prolog to Logtalk Objects: Effective Code Encapsulation and Reuse (PM), p. 23.
ICLP-2009-Todorova #natural language #using: Answering Questions from Natural Language Using A-Prolog (YT), pp. 544–546.
ICLP-2009-Wielemaker #using #web: Enabling Serendipitous Search on the Web of Data Using Prolog (JW), p. 36.
PEPM-2008-PietrzakCPH #analysis #composition #source code #verification: A practical type analysis for verification of modular prolog programs (PP, JC, GP, MVH), pp. 61–70.
SAC-2008-CimadamoreV #java #type inference: Integrating Java and Prolog through generic methods and type inference (MC, MV), pp. 198–205.
SAC-2008-PiancastelliBOR #architecture #design #object-oriented: The architecture and design of a malleable object-oriented prolog engine (GP, AB, AO, AR), pp. 191–197.
ATEM-J-2006-LohmannRW #aspect-oriented: Aspect-oriented prolog in a language processing context (WL, GR, GW), pp. 241–259.
ICLP-2008-LukacsySK #logic #reasoning: Prolog Based Description Logic Reasoning (GL, PS, BK), pp. 455–469.
ICLP-2008-SchrijversCWD #towards: Towards Typed Prolog (TS, VSC, JW, BD), pp. 693–697.
ICLP-2008-SchrijversD #community: Uniting the Prolog Community (TS, BD), pp. 7–8.
CIG-2007-Munoz-HernandezW #fuzzy: Fuzzy Prolog as Cognitive Layer in RoboCupSoccer (SMH, WSW), pp. 340–345.
PADL-2007-Costa #dataset #performance: Prolog Performance on Larger Datasets (VSC), pp. 185–199.
PADL-2007-EichbergKSMO #analysis #automation: Automatic Incrementalization of Prolog Based Static Analyses (ME, MK, DS, MM, KO), pp. 109–123.
SAC-2007-DjelloulDF #constraints #finite #first-order #infinity #theorem proving #towards #unification #using: Toward a first-order extension of Prolog’s unification using CHR: a CHR first-order constraint solver over finite or infinite trees (KD, TBHD, TWF), pp. 58–64.
ICLP-2007-BaralDT #information management #natural language #set #towards: Towards Overcoming the Knowledge Acquisition Bottleneck in Answer Set Prolog Applications: Embracing Natural Language Inputs (CB, JD, LT), pp. 1–21.
ICLP-2007-CostaSL: Demand-Driven Indexing of Prolog Clauses (VSC, KFS, RL), pp. 395–409.
ICLP-2007-Hunyadi #framework #interface #named #web: Prosper: A Framework for Extending Prolog Applications with a Web Interface (LH), pp. 432–433.
ICLP-2007-Palshikar #execution #graph grammar #representation: Representation and Execution of a Graph Grammar in Prolog (GKP), pp. 442–443.
ICLP-2007-RochaSL #on the #program transformation: On Applying Program Transformation to Implement Suspension-Based Tabling in Prolog (RR, CS, RL), pp. 444–445.
ICLP-2007-Zhou: A Register-Free Abstract Prolog Machine with Jumbo Instructions (NFZ), pp. 455–457.
SEKE-2006-ZhaoGQC #abstraction #constraints #semantics: A Constraint-based Correct Call Pattern Semantics for Prolog as an Abstraction of Decorated Tree Semantics (LZ, TG, JQ, GC), pp. 359–362.
LOPSTR-2006-MoralesCH #automaton #optimisation #towards: Towards Description and Optimization of Abstract Machines in an Extension of Prolog (JFM, MC, MVH), pp. 77–93.
PADL-2006-NagyLS #logic #query: Translating Description Logic Queries to Prolog (ZN, GL, PS), pp. 168–182.
PADL-2006-SahaR #evaluation #incremental #logic programming #source code: Incremental Evaluation of Tabled Prolog: Beyond Pure Logic Programs (DS, CRR), pp. 215–229.
PADL-2006-SoaresRF: Generic Cut Actions for External Prolog Predicates (TS, RR, MF), pp. 16–30.
LDTA-2006-SierraF #agile #attribute grammar #framework #prototype: A Prolog Framework for the Rapid Prototyping of Language Processors with Attribute Grammars (JLS, AFV), pp. 19–36.
ICLP-2006-HaemmerleF #revisited: Modules for Prolog Revisited (RH, FF), pp. 41–55.
ICLP-2006-KingLG #detection #source code: Detecting Determinacy in Prolog Programs (AK, LL, SG), pp. 132–147.
ICLP-2006-Lukacsy #logic #reasoning: Description Logic Reasoning in Prolog (GL), pp. 463–464.
ICLP-2006-SilvaRL #implementation #linear: An External Module for Implementing Linear Tabling in Prolog (CS, RR, RL), pp. 429–430.
ICLP-2006-SzaboS #standard: Improving the ISO Prolog Standard by Analyzing Compliance Test Results (PS, PS), pp. 257–269.
ITiCSE-2005-WermelingerD #automaton #formal method #tool support: A prolog toolkit for formal languages and automata (MW, AMD), pp. 330–334.
TLCA-2005-UrbanC: Avoiding Equivariance in αProlog (CU, JC), pp. 401–416.
LOPSTR-2005-OchoaPH #source code: Removing Superfluous Versions in Polyvariant Specialization of Prolog Programs (CO, GP, MVH), pp. 80–97.
PPDP-2005-CraigL #self: Self-tuning resource aware specialisation for prolog (SJC, ML), pp. 23–34.
ICLP-2005-ChristiansenD #abduction #logic programming #named #programming language: HYPROLOG: A New Logic Programming Language with Assumptions and Abduction (HC, VD), pp. 159–173.
ICLP-2005-RochaLSC #modelling #named: IMPACT: Innovative Models for Prolog with Advanced Control and Tabling (RR, RL, FMAS, VSC), pp. 416–417.
ICLP-2005-Wielemaker #implementation #query #semantics #web: An Optimised Semantic Web Query Language Implementation in Prolog (JW), pp. 128–142.
FLOPS-2004-CraigL #effectiveness #named #self: LIX: an Effective Self-applicable Partial Evaluator for Prolog (SJC, ML), pp. 85–99.
KR-2004-TranB #interactive #reasoning: Reasoning about Triggered Actions in AnsProlog and Its Application to Molecular Interactions in Cells (NT, CB), pp. 554–564.
LOPSTR-2004-CraigGLH #analysis #automation: Fully Automatic Binding-Time Analysis for Prolog (SJC, JPG, ML, KSH), pp. 53–68.
LOPSTR-2004-PueblaAH #performance: Efficient Local Unfolding with Ancestor Stacks for Full Prolog (GP, EA, MVH), pp. 149–165.
PADL-2004-ElkhatibPS #named #reasoning #set #source code: ASP-PROLOG: A System for Reasoning about Answer Set Programs in Prolog (OEK, EP, TCS), pp. 148–162.
PADL-2004-MoralesCH #c #compilation #using: Improved Compilation of Prolog to C Using Moded Types and Determinism Information (JFM, MC, MVH), pp. 86–103.
PPDP-2004-FarwerL #model checking #petri net: Model checking object petri nets in prolog (BF, ML), pp. 20–31.
ICLP-2004-CheneyU #logic programming #named #programming language: αProlog: A Logic Programming Language with Names, Binding and α-Equivalence (JC, CU), pp. 269–283.
ICLP-2004-HanakSS #debugging #library: FDBG, the CLPFD Debugger Library of SICStus Prolog (DH, TS, PS), pp. 458–459.
ICLP-2004-Nguyen #logic programming #named: MProlog: An Extension of Prolog for Modal Logic Programming (LAN), pp. 469–470.
ICLP-2004-Schrijvers #generative #java #memory management #named: JmmSolve: A Generative Java Memory Model Implemented in Prolog and CHR (TS), pp. 475–476.
ICLP-2004-SchrijversS #refactoring #source code: Improving Prolog Programs: Refactoring for Prolog (TS, AS), pp. 58–72.
LOPSTR-2003-FischerV #syntax #synthesis: Adding Concrete Syntax to a Prolog-Based Program Synthesis System (BF, EV), pp. 56–58.
PADL-2003-Porto #information management: An Integrated Information System Powered by Prolog (AP), pp. 92–109.
PADL-2003-ZhouT #algorithm #garbage collection: Garbage Collection Algorithms for Java-Based Prolog Engines (QZ, PT), pp. 304–319.
ICLP-2003-LangevineDD #implementation #performance: A Propagation Tracer for GNU-Prolog: From Formal Definition to Efficient Implementation (LL, MD, PD), pp. 269–283.
ICLP-2003-Wielemaker #thread: Native Preemptive Threads in SWI-Prolog (JW), pp. 331–345.
PADL-2002-VandeginsteSD #garbage collection #order: Segment Order Preserving and Generational Garbage Collection for Prolog (RV, KFS, BD), pp. 299–317.
ICLP-2002-MartinNSS #learning #logic: Learning in Logic with RichProlog (EM, PMN, AS, FS), pp. 239–254.
ICLP-2002-OlmerS #logic programming #source code: Schema-Based Transformations of Logic Programs in λ-Prolog (PO, PS), p. 472.
ICLP-2002-OsorioNA #approach #debugging #logic: Debugging in A-Prolog: A Logical Approach (MO, JANP, JA), pp. 482–483.
ICLP-2002-VaucheretGM #fuzzy #implementation #using: Fuzzy Prolog: A Simple General Implementation Using CLP(R) (CV, SG, SMH), p. 469.
ITiCSE-2001-Fowler #using: Web-based CALL using prolog (AF), p. 181.
FLOPS-J2-1998-Hinze01 #axiom #functional #implementation: Prolog’s Control Constructs in a Functional Setting — Axioms and Implementation (RH), pp. 125–170.
FLOPS-2001-Delzanno #case study #debugging #protocol #security #specification: Specifying and Debugging Security Protocols via Hereditary Harrop Formulas and λ Prolog — A Case-study (GD), pp. 123–137.
FLOPS-2001-Nadathur #implementation #metalanguage: The Metalanguage λ-Prolog and Its Implementation (GN), pp. 1–20.
PADL-2001-DentiOR #internet: tu Prolog: A Light-Weight Prolog for Internet Applications and Infrastructures (ED, AO, AR), pp. 184–198.
PADL-2001-Leuschel #csp #design #implementation #specification: Design and Implementation of the High-Level Specification Language CSP(LP) in Prolog (ML), pp. 14–28.
PADL-2001-NogueiraBGWB: An A-Prolog Decision Support System for the Space Shuttle (MN, MB, MG, RW, MB), pp. 169–183.
PADL-2001-TyagiT #algorithm #interface: A Most Specific Method Finding Algorithm for Reflection Based Dynamic Prolog-to-Java Interfaces (ST, PT), pp. 322–336.
PPDP-2001-NassenCS #virtual machine: Instruction Merging and Specialization in the SICStus Prolog Virtual Machine (HN, MC, KFS), pp. 49–60.
SAS-2001-Blanchet #encryption #protocol: Abstracting Cryptographic Protocols by Prolog Rules (BB), pp. 433–436.
LDTA-2001-LammelR: Prological Language Processing (RL, GR), pp. 132–156.
ICLP-2001-CastroC #comprehension #memory management: Understanding Memory Management in Prolog Systems (LFC, VSC), pp. 11–26.
ICLP-2001-VillaverdePGG #architecture #implementation #named: PALS: An Or-Parallel Implementation of Prolog on Beowulf Architectures (KV, EP, HFG, GG), pp. 27–42.
ICLP-2001-Wielemaker: Building Real-Life Applications with Prolog (JW), p. 7.
LOPSTR-2000-Demoen #abduction #garbage collection: Prolog and abduction 4 writing garbage collectors (BD).
LOPSTR-2000-JahierDR #continuation #modelling #semantics #specification: Specifying Prolog trace models with a continuation semantics (EJ, MD, OR).
LOPSTR-J-2000-JahierDR #continuation #modelling #semantics #specification: Specifying Prolog Trace Models with a Continuation Semantics (EJ, MD, OR), pp. 165–182.
PADL-2000-DiazC #c #compilation: GNU Prolog: Beyond Compiling Prolog to C (DD, PC), pp. 81–92.
PADL-2000-Moreno-NavarroM #compilation #how: How to Incorporate Negation in a Prolog Compiler (JJMN, SMH), pp. 124–140.
PPDP-2000-Li #memory management #performance #stack: Efficient memory management in a merged heap/stack prolog machine (XL), pp. 245–256.
SAC-2000-DiazC #implementation: The GNU Prolog System and its Implementation (DD, PC), pp. 728–732.
ISMM-2000-Makholm #memory management: A Region-Based Memory Manager for Prolog (HM), pp. 25–34.
WRLA-2000-KulasB #logic #standard: Defining Standard Prolog in Rewriting Logic (MK, CB), pp. 158–174.
CL-2000-GrasH: A New Module System for Prolog (DCG, MVH), pp. 131–148.
CL-2000-Tarau #named #refactoring: Fluents: A Refactoring of Prolog for Uniform Reflection an Interoperation with External Objects (PT), pp. 1225–1239.
PASTE-1999-KokaiNN #named #programming #visual notation: GIDTS: A Graphical Programming Environment for Prolog (GK, JN, CN), pp. 95–104.
FLOPS-1999-BeierleM #approximate #source code #type checking #using: Using Types as Approximations for Type Checking Prolog Programs (CB, GM), pp. 251–266.
FLOPS-1999-RidouxBM #static analysis: Typed Static Analysis: Application to Groundness Analysis of PROLOG and λ-PROLOG (OR, PB, FM), pp. 267–283.
ICEIS-1999-CarvalhoPJ #java #logic programming #virtual machine: NETPROLOG-A Logic Programming System for the Java Virtual Machine (CLdC, ECP, RMdSJ), pp. 591–598.
LOPSTR-1999-Kulas #concept #runtime: Annotations for Prolog — A Concept and Runtime Handling (MK), pp. 234–254.
PPDP-1999-Costa #bytecode #optimisation: Optimising Bytecode Emulation for Prolog (VSC), pp. 261–277.
PPDP-1999-HolzbaurF #compilation #constraints: Compiling Constraint Handling Rules into Prolog with Attributed Variables (CH, TWF), pp. 117–133.
PPDP-1999-VerbaetenSS #composition #proving #termination: Modular Termination Proofs for Prolog with Tabling (SV, KFS, DDS), pp. 342–359.
CADE-1999-NadathurM #automaton #compilation #implementation #λ-calculus: System Description: Teyjus — A Compiler and Abstract Machine Based Implementation of lambda-Prolog (GN, DJM), pp. 287–291.
ICLP-1999-AppelF #lightweight: Lightweight Lemmas in λ-Prolog (AWA, APF), pp. 411–425.
ICLP-1999-Asvanyi: Adding Functions to SICStus Prolog (TÁ), p. 605.
ICLP-1999-Bowen: Adventures in the Prolog Trade (KAB), p. 22.
ICLP-1999-CarroH #concurrent #database #thread #using: Concurrency in Prolog Using Threads and a Shared Database (MC, MVH), pp. 320–334.
ICLP-1999-Kahn: From Prolog and Zelta to ToonTalk (KMK), pp. 67–78.
ICLP-1999-Li #garbage collection #implementation: Implementing Prolog with Chronological Garbage Collection (XL), p. 612.
ICLP-1999-Penn #encoding: An Optimized Prolog Encoding of Typed Feature Structures (GP), pp. 124–138.
ITiCSE-1998-MansouriGH #automation #named: PRAM: prolog automatic marker (FZM, CAG, CAH), pp. 166–170.
FLOPS-1998-Hinze #axiom #functional #implementation: Prological Features in a Functional Setting Axioms and Implementation (RH), pp. 98–122.
ALP-PLILP-1998-EskilsonC #execution #parallel #thread: SICStus MT — A Multithreaded Execution Environment for SICStus Prolog (JE, MC), pp. 36–53.
ALP-PLILP-1998-Hannan #program analysis: Program Analysis in λ-Prolog (JH), pp. 353–354.
ISMM-1998-DemoenS #memory management: Memory Management for Prolog with Tabling (BD, KFS), pp. 97–106.
JICSLP-1998-DeviennePTV #text-to-text: Source-to-source Prolog Program Compression (PD, AP, PT, SV), pp. 205–219.
JICSLP-1998-MalesiuexRB #compilation: Abstract Compilation of λ-Prolog (FM, OR, PB), pp. 130–144.
WIA-1997-KirazE #automaton #implementation #multi #speech: Multi-tape Automata for Speech and Language Systems: A Prolog Implementation (GAK, EGE), pp. 87–103.
LOPSTR-1997-RichardsonF #development #source code: Development of Correct Transformation Schemata for Prolog Programs (JR, NEF), pp. 263–281.
ASF+SDF-1997-Brunekreef #algebra #source code #specification: An algebraic specification of a transformation tool for Prolog programs (JB), p. 7.
PDP-1997-CunhaM #algorithm #development #distributed: Distributed algorithm development with PVM-prolog (JCC, RFPM), pp. 211–215.
ICLP-1997-PontelliGPF #automation #parallel #source code: Automatic Compile-time Parallelization of Prolog Programs for Dependent And-Parallelism (EP, GG, FP, AF), pp. 108–122.
LOPSTR-1996-Brunekreef #source code: A Transformation Tool for Pure Prolog Programs (JB), pp. 130–145.
LOPSTR-1996-CortesiCR #automation #source code #verification: Specification-Based Automatic Verification of Prolog Programs (AC, BLC, SR), pp. 38–57.
PLILP-1996-Antoy: Needed Narrowing in Prolog (SA), pp. 473–474.
PLILP-1996-Li #approach #implementation: Program Sharing: A New Implementation Approach for Prolog (XL), pp. 259–273.
PLILP-1996-LouvetR #morphism #parametricity #polymorphism: Parametric Polymorphism for Typed Prolog and λ-Prolog (PL, OR), pp. 47–61.
PLILP-1996-WeyerW #analysis #graph: Annotated Structure Shape Graphs for Abstract Analysis of Prolog (GW, WHW), pp. 92–106.
SAS-1996-MullerGS #automation #composition #proving #source code #termination: Automated Modular Termination Proofs for Real Prolog Programs (MM, TG, KS), pp. 220–237.
SAS-1996-MullerGS96a #named: PAN — The Prolog Analyzer (MM, TG, KS), pp. 387–388.
SAS-1996-SchoenigD #algorithm #slicing: A Backward Slicing Algorithm for Prolog (SS, MD), pp. 317–331.
SAC-1996-DemoenET #garbage collection #order: Segment order preserving copying garbage collection for WAM based Prolog (BD, GE, PT), pp. 380–386.
ESOP-1996-BarbutiM #logic #multi #semantics: A Multiple-Valued Logical Semantics for Prolog (RB, PM), pp. 62–76.
ESOP-1996-BuenoGHP #analysis #source code #standard: Global Analysis of Standard Prolog Programs (FB, DCG, MVH, GP), pp. 108–124.
CADE-1996-SchaubBN #named #proving #reasoning #theorem proving: XRay: A Prolog Technology Theorem Prover for Default Reasoning: A System Description (TS, SB, PN), pp. 293–297.
JICSLP-1996-Ridoux #attribute grammar: Engineering Transformations of Attributed Grammars in λProlog (OR), pp. 244–258.
SEKE-1995-CanforaCT #maintenance: Prolog for Software Maintenance (GC, AC, MT), pp. 478–486.
LOPSTR-1995-Hanus #functional #lazy evaluation #logic programming #performance #source code: Efficient Translation of Lazy Functional Logic Programs into Prolog (MH), pp. 252–266.
SAS-1995-Fecht #generative #named #specification: GENA — A Tool for Generating Prolog Analyzers from Specifications (CF), pp. 418–419.
SAS-1995-NordinLM #data flow #named: IGOR: A Tool for Developing Prolog Dataflow Analyzers (MN, TL, HM), pp. 420–421.
SAS-1995-RaoS #execution #source code: Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs (MRKKR, RKS), pp. 243–260.
SAC-1995-TarauDB #empirical #power of: The power of partial tanslation: an experiment with the C-ification of binary Prolog (PT, BD, KDB), pp. 152–156.
PDP-1995-Kacsuk #data flow #parallel: Dataflow model for handling cut in the LOGFLOW parallel prolog machine (PK), pp. 60–67.
ICLP-1995-BarbutiFS #execution #modelling #using: Modeling OR-Parallel Execution of Prolog using CHOCS (RB, NDF, AS), pp. 547–561.
ICLP-1995-CodognetD #c #compilation #named: WAMCC: Compiling Prolog to C (PC, DD), pp. 317–331.
ICLP-1995-Gegg-Harrison #logic programming #representation: Representing Logic Program Schemata in λ-Prolog (TSGH), pp. 467–481.
ICLP-1995-KrallB #automaton #compilation #incremental: Incremental Global Compilation of Prolog with the Vienna Abstract Machine (AK, TB), pp. 333–347.
ICLP-1995-PontelliGT #implementation #optimisation: Determinacy Driven Optimizations of And-Parallel Prolog Implementations (EP, GG, DT), pp. 615–629.
ICLP-1995-SagonasW #execution #implementation #performance: Efficient Execution of HiLog in WAM-based Prolog Implementations (KFS, DSW), pp. 349–363.
ILPS-1995-Andrews #semantics: A Paralogical Semantics for the Prolog Cut (JHA), pp. 591–605.
ILPS-1995-Lindgren #analysis #control flow: Control Flow Analysis of Prolog (TL), pp. 432–446.
ILPS-1995-TseWL #concurrent #logic programming #object-oriented #programming language: P&P: A Combined Parlog and Prolog Concurrent Object-Oriented Logic Programming Language (MlT, WhW, HfL), p. 640.
SEKE-1994-AzemB #reliability #source code: Reliability determination of Prolog programs (AA, FB), pp. 422–429.
SEKE-1994-BelliJ #testing: A test environment for Prolog (FB, OJ), pp. 430–437.
PLDI-1994-HentenryckCC #analysis #graph #using: Type Analysis of Prolog Using Type Graphs (PVH, AC, BLC), pp. 337–348.
PLILP-1994-BevemyrL #garbage collection #performance: A Simple and Efficient Copying Garbage Collector for Prolog (JB, TL), pp. 88–101.
PLILP-1994-Leal #source code #visualisation: A System to Visualize and Interact with Prolog Programs (JPL), pp. 451–452.
SAS-1994-Getzinger #abstract interpretation #cost analysis #optimisation: The Costs and Benefits of Abstract Interpretation-driven Prolog Optimization (TWG), pp. 1–25.
SAC-1994-BosschereT #continuation #performance: High performance continuation passing style Prolog-to-C mapping (KDB, PT), pp. 383–387.
SAC-1994-KaraliH #data type #parallel: Abstract data type support in Prolog and its relation to parallelism (IK, CH), pp. 415–419.
PDP-1994-RodohanGJ #implementation #set: An Implementation Of A Set Mode For Prolog On A Parallell Associative Processor (DPR, RJG, IPJ), pp. 413–419.
ESOP-1994-Li #specification #π-calculus: A π-Calculus Specification of Prolog (BZL), pp. 379–393.
ICLP-1994-AraujoR #distributed #execution #independence #named #parallel: PDP: Prolog Distributed Processor for Independent AND/OR Parallel Execution of Prolog (LA, JJR), pp. 142–156.
ICLP-1994-Haygood #compilation: Native Code Compilation in SICStus Prolog (RCH), pp. 190–204.
ICLP-1994-Kagedal #analysis #data flow: A Dataflow Analysis Method for Ground Prolog (AK), p. 746.
ICLP-1994-Pedreschi #proving #runtime #source code: A Proof Method for Runtime Properties of Prolog Programs (DP), pp. 584–598.
ICLP-1994-Zhou #on the #stack: On the Scheme of Passing Arguments in Stack Frames for Prolog (NFZ), pp. 159–174.
ILPS-1994-BraemCMH #analysis: Cardinality Analysis of Prolog (CB, BLC, SM, PVH), pp. 457–471.
ILPS-1994-CharlierRH #abstract interpretation #framework: An Abstract Interpretation Framework which Accurately Handles Prolog Search-Rule and the Cut (BLC, SR, PVH), pp. 157–171.
ILPS-1994-Lindgren #continuation: A Continuation-Passing Style for Prolog (TL), pp. 603–617.
ILPS-1994-McCartyS #first-order #interpreter #logic: A PROLOG Interpreter for First-Order Intuitionistic Logic (LTM, LAS), p. 685.
ILPS-1994-RameshC: A Portable Method of Integrating SLG Resolution into Prolog Systems (RR, WC), pp. 618–632.
ILPS-1994-SagonasW #compilation: A Portable Compiler for Integrating HiLog into Prolog Systems (KFS, DSW), p. 682.
LICS-1994-Stark #declarative #semantics: The Declarative Semantics of the Prolog Selection Rule (RFS), pp. 252–261.
SEKE-1993-AzemBJ #reliability #source code #testing: Implementation-Oriented Testing and Reliability Determination of Prolog Programs (AA, FB, OJ), pp. 526–533.
SEKE-1993-ShinCY #source code #type inference: Mode Based Type Inference for Prolog Programs (DS, YC, HY), pp. 239–243.
LOPSTR-1993-BoeckC #logic: Mechanical Transformation of Logic Definitions Augmented with Type Information into Prolog Procedures: Some Experiments (PDB, BLC), pp. 229–245.
LOPSTR-1993-Grobelnik #induction #source code: Induction of Prolog Programs with Markus (MG), pp. 57–63.
LOPSTR-1993-Vargas-VeraRI #editing #source code: Combining Prolog Programs in a Techniques Editing System (MVV, DSR, RI), pp. 82–84.
LOPSTR-1993-Vasconcelos #design #programming: Designing Prolog Programming Techniques (WWV), pp. 85–99.
PEPM-1993-CharlierH #analysis #evaluation #implementation: Groundness Analysis for PROLOG: Implementation and Evaluation of the Domain Prop (BLC, PVH), pp. 99–110.
PLILP-1993-BenjumeaT #distributed #memory management #parallel: An OR Parallel Prolog Model for Distributed Memory Systems (VB, JMT), pp. 291–301.
PLILP-1993-CorsiniMRC #abstract interpretation #bottom-up #constraints #finite #performance #theorem proving: Efficient Bottom-up Abstract Interpretation of Prolog by Means of Constraint Solving over Symbolic Finite Domains (MMC, KM, AR, BLC), pp. 75–91.
PLILP-1993-Dikovsky #complexity: Abstract Complexity of Prolog Based on WAM (AJD), pp. 365–377.
PLILP-1993-Kagedal #analysis: Improvements in Compile-Time Analysis for Ground Prolog (AK), pp. 92–107.
WSA-1993-CharlierDMH #abstract interpretation #algorithm #fixpoint #optimisation #performance: Optimization Techniques for General Purpose Fixpoint Algorithms — Practical Efficiency for the Abstract Interpretation of Prolog (BLC, OD, LM, PVH), pp. 15–26.
WSA-1993-HentenryckDCM #abstract interpretation: The Impact of Granularity in Abstract Interpretation of Prolog (PVH, OD, BLC, LM), pp. 1–14.
SAC-1993-KaraliPH: A Versatile Module System for Prolog Mapped to Flat Prolog (IK, EP, CH), pp. 578–585.
SAC-1993-RankinW #combinator #fixpoint #using: Finding Fixed Point Combinators Using Prolog (RR, RWW), pp. 604–608.
PDP-1993-BenjumeaRT #distributed #evaluation #interpreter #parallel: A Prolog interpreter for OR parallelism evaluation on distributed systems (VB, MR, JMT), pp. 105–112.
PDP-1993-Kacsuk #implementation #parallel: Cut implementation in a massively parallel Prolog system (PK), pp. 96–103.
CSL-1993-Gomolko #consistency #logic #nondeterminism: Negation as Inconsistency in PROLOG via Intuitionistic Logic (AG), pp. 128–138.
ICLP-1993-Balogh #interface #sql: The SQL Interface of MProlog (KB), pp. 829–830.
ICLP-1993-BeaumontW #scheduling: Scheduling Speculative Work in Or-Parallel Prolog Systems (TB, DHDW), pp. 135–149.
ICLP-1993-BevemyrLM #implementation: Reform Prolog: The Language and Its Implementation (JB, TL, HM), pp. 283–298.
ICLP-1993-BorgerR #in a nutshell: Full Prolog in a Nutshell (EB, DR), p. 832.
ICLP-1993-BosschereJ #implementation #multi #named #semantics: Multi-Prolog: Definition, Operational Semantics and Implementation (KDB, JMJ), pp. 299–313.
ICLP-1993-BossiBF #fixpoint #semantics: A New Fixpoint Semantics for Prolog (AB, MB, MF), pp. 374–389.
ICLP-1993-BrissetR #continuation: Continuations in λ-Prolog (PB, OR), pp. 27–43.
ICLP-1993-FarkasGMU #development #knowledge base #named: ZEXPERT — A Prolog-Based Shell for Knowledge Base Development (ZF, GG, KM, GU), pp. 835–836.
ICLP-1993-Futo #communication #process: Prolog with Communicating Processes: From T-Prolog to CSR-Prolog (IF), pp. 3–17.
ICLP-1993-GrantJ #modelling #tool support: A Prolog Toolkit for control System Models (PWG, CPJ), pp. 839–840.
ICLP-1993-Gusikhin #integration #scheduling: Integration of Traditional Scheduling Techniques and AI on Prolog Basis (OYG), p. 841.
ICLP-1993-HuitouzeLR #logic: Logic Grammars and λ-Prolog (SLH, PL, OR), pp. 64–79.
ICLP-1993-McCarty #higher-order #induction #logic #proving #source code: Proving Inductive Properties of Prolog Programs in Second-Order Intuitionistic Logic (LTM), pp. 44–63.
ICLP-1993-Reviakin #logic programming: Logic Programming System Prolog-plus (MR), p. 850.
ICLP-1993-WeiglFMF #fuzzy #named: Istropolitan — a WAM Based Fuzzy Prolog (IW, MF, SM, RF), p. 852.
ILPS-1993-Andrews #logic #semantics: A Logical Semantics for Depth-First Prolog with Ground Negation (JHA), pp. 220–234.
ILPS-1993-Apt #declarative #programming: Declarative Programming in Prolog (KRA), pp. 12–35.
ILPS-1993-BosschereT #parallel #programming: Blackboard-based Extensions for Parallel Programming in BinProlog (KDB, PT), p. 664.
ILPS-1993-ChanS: A Prolog-Based Definition of an Entity Relationship Language (HCC, KS), p. 650.
ILPS-1993-KirschenbaumS #proving #source code: Enhancement Structures for Proving Prolog Programs Correct (MK, LS), p. 631.
ILPS-1993-Li #specification #π-calculus: A π-calculus Specification of Prolog (ZL), p. 680.
ILPS-1993-LuskMOS #biology #parallel: Applications of the Aurora Parallel Prolog System to Computational Molecular Biology (ELL, SM, RAO, PS), pp. 353–369.
ILPS-1993-TakahashiS #functional: Prolog Interpretation of A Functional-Logic Language (ST, FSKS), p. 672.
ILPS-1993-Vargas-VeraVR #editing #scalability #source code #using: Building Large-Scale Prolog Programs using a Techniques Editing System (MVV, WWV, DSR), p. 636.
ILPS-1993-Zhou #compilation #on the #parametricity: On the Direct Parameter Passing Mechanism for Prolog Compilers (NFZ), p. 655.
ISSTA-1993-BelliJ #analysis #source code #testing: Implementation-Based Analysis and Testing of Prolog Programs (FB, OJ), pp. 70–80.
SEKE-1992-LoiaCQ #framework #implementation #incremental: Incremental, High Level Implementation of Prolog in an Open System Framework (VL, GC, MQ), pp. 394–403.
ALP-1992-AptMP #first-order #formal method: A Theory of First-Order Built-in’s of Prolog (KRA, EM, CP), pp. 69–83.
ALP-1992-BarbutiCGM #semantics: Oracle Semantics for Prolog (RB, MC, RG, MJM), pp. 100–114.
LOPSTR-1992-Demoen #on the #performance: On the Transformation of a Prolog Program to a More Efficient Binary Program (BD), pp. 242–252.
LOPSTR-1992-Jimenez-MartinMM #compilation #lazy evaluation #performance: Efficient Compilation of Lazy Narrowing into Prolog (JAJM, JMC, JJMN), pp. 253–270.
LOPSTR-1992-Jones #programming: Applications of Unfolding in Prolog Programming (JJ), pp. 184–198.
LOPSTR-1992-MogensenB #named #self: Logimix: A Self-Applicable Partial Evaluator for Prolog (TÆM, AB), pp. 214–227.
LOPSTR-1992-ParrainDL #abstract interpretation #optimisation #source code #towards: Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation (AP, PD, PL), pp. 228–241.
LOPSTR-1992-Prestwich: An Unfold Rule for Full Prolog (SDP), pp. 199–213.
PLILP-1992-Ducasse #query: A General Trace Query Mechanism Based on Prolog (MD), pp. 400–414.
PLILP-1992-EnglebertCRH #abstract interpretation #algorithm #evaluation #optimisation: Generic Abstract Interpretation Algorithms For Prolog: Tow Optimization Techniques and Their Experimental Evaluation (VE, BLC, DR, PVH), pp. 310–325.
PLILP-1992-KrallB #compilation #performance: Fast Prolog with VAM1p based Prolog Compiler (AK, TB), pp. 245–259.
PLILP-1992-SolnonR #inheritance #source code: Inference of Inheritance Relationships from Prolog Programs: a System Developed with PrologIII (CS, MR), pp. 489–490.
PLILP-1992-Tarau #continuation #named: BinProlog: a Continuation Passing Style Prolog Engine (PT), pp. 479–480.
POPL-1992-BarbutiCGL #modelling: Modeling Prolog Control (RB, MC, RG, GL), pp. 95–104.
WSA-1992-CorsiniMR #calculus #finite #semantics #μ-calculus: The μ-Calculus over Finite Domains as an Abstract Semantics of Prolog (MMC, KM, AR), pp. 51–59.
WSA-1992-ParrainDL #abstract interpretation #optimisation #source code #towards: Towards Optimization of Full Prolog Programs guided by Abstract Interpretation (AP, PD, PL), pp. 295–303.
IWMM-1992-Pique #garbage collection: Dynamic Revision of Choice Points during Garbage Collection in Prolog [II/III] (JFP), pp. 330–343.
IWMM-1992-Tarau #continuation #memory management: Ecological Memory Management in a Continuation Passing Prolog Engine (PT), pp. 344–356.
JICSLP-1992-CharlierH #abstract interpretation: Reexecution in Abstract Interpretation of Prolog (BLC, PVH), pp. 750–764.
JICSLP-1992-ChenRR #algorithm #execution #multi: Multistage Indexing Algorithms for Speeding Prolog Execution (TC, IVR, RR), pp. 639–653.
JICSLP-1992-OlderR #garbage collection #incremental: An Incremental Garbage Collector for WAM-Based Prolog (WJO, JAR), pp. 369–383.
JICSLP-1992-RouzaudN #type system: Integrating Modes and Subtypes into a Prolog Type-Checker (YR, LNP), pp. 85–97.
JICSLP-1992-Shen: Exploiting Dependent And-Parallelism in Prolog: The Dynamic Dependent And-Parallel Scheme (DDAS) (KS), pp. 717–731.
LOPSTR-1991-JiaoG #database #object-oriented #optimisation #query #using: Query Optimization in an Object-Oriented Database using Prolog (ZJ, PMDG), pp. 332–334.
LOPSTR-1991-ParrainDL #program transformation: Prolog Program Transformations and Meta-Interpreters (AP, PD, PL), pp. 238–251.
LOPSTR-1991-Popelinsky #source code #synthesis #towards: Towards Synthesis of Nearly Pure Prolog Programs (LP), pp. 94–96.
LOPSTR-1991-ReadK #case study #composition #development: Formal Program Development in Modular Prolog: A Case Study (MGR, EAK), pp. 69–93.
LOPSTR-1991-Ross #partial evaluation #semantics #source code: Semantics-based Partial Evaluation of Prolog Programs (BJR), pp. 221–237.
LOPSTR-1991-SolnonR #design #object-oriented #prototype #using: Using a Prolog Prototype for Designing an Object Oriented Scheme (CS, MR), pp. 300–317.
PEPM-1991-ProiettiP #semantics: Semantics Preserving Transformation Rules for Prolog (MP, AP), pp. 274–284.
PEPM-1991-Sahlin #analysis: Determinacy Analysis for Full Prolog (DS), pp. 23–30.
PLILP-1991-BorgerD #database #framework: A Framework to Specify Database Update Views for Prolog (EB, BD), pp. 147–158.
PLILP-1991-CheongF #integration #performance: Efficient Integration of Simplifications into Prolog (PHC, LF), pp. 359–370.
PLILP-1991-ConselK #compilation #generative #semantics: Semantics-Directed Generation of a Prolog Compiler (CC, SCK), pp. 135–146.
PLILP-1991-Ferenczi #composition #concept #distributed: Concepts for a Modular and Distributed Prolog Language (SF), pp. 159–170.
PLILP-1991-Naish #equation: Adding equations to NU-Prolog (LN), pp. 15–26.
WSA-1991-BarbutiCGL #modelling: Modelling Prolog Control (RB, MC, RG, GL), pp. 117–124.
WSA-1991-BoeckC #analysis #automation #type checking: Automatic Construction of Prolog Primitives for Type Checking Analysis (PDB, BLC), pp. 165–172.
WSA-1991-GriffithsMP #french: Analyse et transformation de programmes Prolog en vue de leur parallélisation avec les prédicats parand et paror (MG, PM, CP), pp. 217–224.
WSA-1991-LecoutreDL #french: Une analyse du comportement récursif de programmes Prolog par une interprétation abstraite (CL, PD, PL), pp. 62–69.
WSA-1991-ParrainDL #french #validation: Techniques de transformations de programmes Prolog généraux et validation de méta-interpréteurs (AP, PD, PL), pp. 132–138.
PPoPP-1991-CostaWY #named #parallel: Andorra-I: A Parallel Prolog System that Transparently Exploits both And- and Or-Parallelism (VSC, DHDW, RY), pp. 83–93.
ICLP-1991-ChengRS #metaprogramming: Higher Level Meta Programming in Qu-Prolog 3: 0 (ASKC, PJR, JS), pp. 285–298.
ICLP-1991-CostaWY #preprocessor: The Andorra-I Preprocessor: Supporting Full Prolog on the Basic Andorra Model (VSC, DHDW, RY), pp. 443–456.
ICLP-1991-Ferrand #concept #logic programming: Basic Concepts of Logic Programming and Prolog (GF), p. 942.
ICLP-1991-Meier #recursion: Recursion versus Iteration in Prolog (MM), pp. 157–169.
ICLP-1991-MigaultRC: Prolog as a Host Language (BM, FR, LC), p. 890.
ICLP-1991-Monin #compilation #using: Real-size Compiler Writing Using Prolog with Arrows (JFM), pp. 188–201.
ICLP-1991-PalmerN #named #parallel: NUA-Prolog: An Extension to the WAM for Parallel Andorra (DP, LN), pp. 429–442.
ICLP-1991-RossS #algebra #semantics #termination: An Algebraic Semantics of Prolog Program Termination (BJR, AS), pp. 316–330.
ICLP-1991-Scowen #overview #problem #standard: An Overview of Prolog Standardization — Progress, Problems and Solutions (RSS), pp. 922–936.
ISLP-1991-Ducasse: Abstract Views of Prolog Executions in Opium (MD), pp. 18–32.
ISLP-1991-LakshmanR #re-engineering #semantics #type system: Typed Prolog: A Semantic Reconstruction of the Mycroft-O’Keefe Type System (TLL, USR), pp. 202–217.
ISLP-1991-Plumer #automation #proving #source code #termination: Automatic Termination Proofs for Prolog Programs Operating on Nonground Terms (LP), pp. 503–517.
ISLP-1991-StrooperH #c #testing: Prolog Testing of C Modules (PAS, DH), pp. 596–608.
ISLP-1991-Szeredi #using: Using Dynamic Predicates in an Or--Parallel Prolog System (PS), pp. 355–371.
PLILP-1990-BoeckC #analysis #correctness #static typing: Static Type Analysis of Prolog Procedures for Ensuring Correctness (PDB, BLC), pp. 222–237.
PLILP-1990-DumortierB #automation #generative #on the: On the Automatic Generation of Events in Delta Prolog (VD, MB), pp. 324–339.
PLILP-1990-Fribourg #execution: A New Presburger Arithmetic Decision Procedure Based on Extended Prolog Execution (LF), pp. 174–188.
PLILP-1990-Huitouze #data type #implementation: A New Data Structure for Implementing Extensions to Prolog (SLH), pp. 136–150.
PLILP-1990-Sahlin #fixpoint #using: Finding the Least Fixed Point Using Wait-Declarations in Prolog (DS), pp. 151–158.
POPL-1990-RameshRW: Automata-Driven Indexing of Prolog Clauses (RR, IVR, DSW), pp. 281–291.
DAC-1990-Jabri #knowledge-based #named: BREL — a Prolog Knowledge-based System Shell for VLSI CAD (MAJ), pp. 272–277.
PPoPP-1990-AmbriolaCD #design #distributed #implementation #logic #parallel: Design and Distributed Implementation of the Parallel Logic Language Shared Prolog (VA, PC, MD), pp. 40–49.
PPoPP-1990-RamkumarK #compilation #implementation #kernel #parallel: A Chare Kernel Implementation of a Parallel Prolog Compiler (BR, LVK), pp. 99–108.
ESOP-1990-SchreyePRB #constraints #implementation #logic programming: Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism (DDS, DP, JR, MB), pp. 106–117.
CADE-1990-FeltyGMP #tutorial #λ-calculus: Tutorial on Lambda-Prolog (APF, ELG, DM, FP), p. 682.
CADE-1990-Satz #adaptation: EXPERT THINKER: An Adaptation of F-Prolog to Microcomputers (RWS), pp. 671–672.
CADE-1990-Stickel #proving #theorem proving: A Prolog Technology Theorem Prover (MES), pp. 673–674.
CADE-1990-Tarver: An Examination of the Prolog Technology Theorem-Prover (MT), pp. 322–335.
CLP-1990-Colmerauer90: Prolog III as it Actually Is (AC), p. 766.
CLP-1990-Fribourg90 #execution #induction #logic programming #proving #source code: Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction (LF), pp. 685–699.
CLP-1990-HaridiJ90 #kernel: Kernel Andorra Prolog and its Computation Model (SH, SJ), pp. 31–46.
CLP-1990-HermenegildoG90 #independence #performance: &-Prolog and its Performance: Exploiting Independent And-Parallelism (MVH, KJG), pp. 253–268.
CLP-1990-KorslootM90 #architecture #comparison #modelling #performance: Sequential Architecture Models for Prolog: A Performance Comparison (MK, HMM), pp. 49–67.
CLP-1990-Malhotra90 #algorithm: An Algorithm for Optimal Back-Striding in Prolog (VMM), pp. 147–158.
CLP-1990-ReynoldsK90 #problem: OR-Parallel Prolog and Search Problems in AI Applications (TJR, PK), pp. 340–354.
CLP-1990-Taylor90 #compilation: LIPS on a MIPS: Results from a Prolog Compiler for a RISC (AT), pp. 174–185.
CLP-1990-ZhouTU90 #automaton: A Matching Tree Oriented Abstract Machine for Prolog (NFZ, TT, KU), pp. 159–173.
CSL-1990-BorgerR #algebra #implementation #towards: From Prolog Algebras Towards WAM — A Mathematical Study of Implementation (EB, DR), pp. 31–66.
CSL-1990-BorgerS #semantics: A Formal Operational Semantics for Languages of Type Prolog III (EB, PHS), pp. 67–79.
CSL-1990-Durdanovic #algorithm #garbage collection #performance: A Fast Garbage Collection Algorithm for WAM-Based Prolog (ID), pp. 110–127.
NACLP-1990-AliK #performance: The Muse Or-Parallel Prolog Model and its Performance (KAMA, RK), pp. 757–776.
NACLP-1990-Andrews #logic: The Logical Structure of Sequential Prolog (JHA), pp. 585–602.
NACLP-1990-Ciepielewski #implementation #parallel: Parallel Implementations of Prolog (AC), p. 835.
NACLP-1990-Hausman #evaluation: Handling Speculative Work in OR-Parallel Prolog: Evaluation Results (BH), pp. 721–736.
NACLP-1990-Meier #compilation: Compilation of Compound Terms in Prolog (MM), pp. 63–79.
NACLP-1990-Pereira #analysis: Prolog and Natural-Language Analysis: Into the Third Decade (FCNP), pp. 813–832.
NACLP-1990-RoyD #analysis #compilation #data flow #optimisation: The Benefits of Global Dataflow Analysis for an Optimizing Prolog Compiler (PVR, AMD), pp. 501–515.
NACLP-1990-Sahlin #approach #automation #partial evaluation: The Mixtus Approach to Automatic Partial Evaluation of Full Prolog (DS), pp. 377–398.
NACLP-1990-Umrigar #order #unification: Finding Advantageous Orders for Argument Unification for the Prolog WAM (ZDU), pp. 80–96.
SEKE-1989-ChenTY #optimisation #query #semantics: Semantic Query Optimization and Prolog (JTC, CRT, WPY), pp. 146–151.
ECOOP-1989-MalenfantLV #logic #named: ObjVProlog: Metaclasses in Logic (JM, GL, JGV), pp. 257–269.
ESEC-1989-Myers #modelling: Structural Modelling of Prolog for Metrication (MM), pp. 351–375.
CAAP-1989-BrogiG #distributed #semantics: A Distributed, Net Oriented Semantics for Delta Prolog (AB, RG), pp. 162–177.
CAAP-1989-BruinV #continuation #semantics: Continuation Semantics for PROLOG with Cut (AdB, EPdV), pp. 178–192.
CCIPL-1989-Dietrich #preprocessor: A Preprocessor Based Module System for Prolog (RD), pp. 126–139.
CSL-1989-Borger #logic #semantics: A Logical Operational Semantics of Full Prolog. Part I: Selection Core and Control (EB), pp. 36–64.
NACLP-1989-BugliesiR #partial evaluation: Partial Evaluation in Prolog: Some Improvements about Cut (MB, FR), pp. 645–660.
NACLP-1989-DemoenMC: Indexing Prolog Clauses (BD, AM, AC), pp. 1001–1012.
NACLP-1989-Lakhotia #programming #source code: Incorporating “Programming Techniques” into Prolog Programs (AL), pp. 426–440.
NACLP-1989-MadanPS #lisp #on the: On the Adequacy of Direct Mapped Caches for Lisp and Prolog Data Reference Patterns (VSM, CJP, GSS), pp. 888–906.
NACLP-1989-Meier: Event Handling in Prolog (MM), pp. 871–887.
NACLP-1989-NadathurJ #towards: Towards a WAM Model for λ-Prolog (GN, BJ), pp. 1180–1198.
NACLP-1989-Roy #unification: An Intermediate Language to Support Prolog’s Unification (PVR), pp. 1148–1164.
NACLP-1989-Szeredi #analysis #performance: Performance Analysis of the Aurora Or-Parallel Prolog System (PS), pp. 713–732.
ECOOP-1988-VaucherLM #concurrent #object-oriented: SCOOP, Structured Concurrent Object-Oriented Prolog (JGV, GL, JM), pp. 191–211.
ALP-1988-Drosten #algebra #case study #comparative #source code #specification: Translating Algebraic Specifications to Prolog Programs: A Comparative Study (KD), pp. 137–146.
ALP-1988-Fribourg #functional #question: Functional Extensions to Prolog: Are they Needed? (LF), pp. 21–29.
PLDI-1988-WeinerR #compilation: A Piggy-back Compiler For Prolog (JLW, SR), pp. 288–296.
PLILP-1988-DesplandMR #code generation #implementation: An Implementation of Retargetable Code Generators in Prolog (AD, MM, RR), pp. 83–104.
PLILP-1988-Hanus #compilation #specification: Formal Specification of a Prolog Compiler (MH), pp. 273–282.
PLILP-1988-Henriques #generative #semantics: A Semantic Evaluator Generating System in Prolog (PRH), pp. 201–218.
PLILP-1988-Monin #compilation #experience: A Compiler Written in Prolog: The Véda Experience (JFM), pp. 119–131.
DAC-1988-Papaspyrdis #verification: A Prolog-Based Connectivity Verification Tool (ACP), pp. 523–527.
ESOP-1988-DietrichH #polymorphism #type system: A Polymorphic Type System with Subtypes for Prolog (RD, FH), pp. 79–93.
ESOP-1988-MartelliR #programming: Enhancing Prolog to Support Prolog Programming Environments (AM, GR), pp. 317–327.
CADE-1988-Azzoune #type inference: Type Inference in Prolog (HA), pp. 258–277.
CADE-1988-BieberCH #named: MOLOG: a Modal PROLOG (PB, LFdC, AH), pp. 762–763.
CADE-1988-ButlerLO #automaton #compilation #performance #program transformation: Notes on Prolog Program Transformations, Prolog Style, and Efficient Compilation to The Warren Abstract Machine (RB, RL, RO), pp. 323–332.
CADE-1988-DincbasHSAH #constraints: The CHIP System: Constraint Handling In Prolog (MD, PVH, HS, AA, AH), pp. 774–775.
CADE-1988-FeltyGHMNS #logic programming #named #programming language #λ-calculus: Lambda-Prolog: An Extended Logic Programming Language (APF, ELG, JH, DM, GN, AS), pp. 754–755.
CADE-1988-MantheyB #named #proving #theorem proving: SATCHMO: A Theorem Prover Implemented in Prolog (RM, FB), pp. 415–434.
CADE-1988-SmithL #implementation: An nH-Prolog Implementation (BTS, DWL), pp. 766–767.
CADE-1988-Stickel88a #proving #theorem proving: A Prolog Technology Theorem Prover (MES), pp. 752–753.
CSL-1988-BuningLS #detection #source code: Loop Detection in Propositional Prolog Programs (HKB, UL, SS), pp. 148–165.
CSL-1988-Luttringhaus #evaluation #interpreter #lazy evaluation: An Interpreter with Lazy Evaluation for Prolog with Functions (SL), pp. 199–225.
CSL-1988-Plumer #automation #proving #source code #termination: Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog Programs (LP), pp. 254–271.
JICSCP-1988-Ali88 #execution: OR-Parallel Execution of Prolog on BC-Machine (KAMA), pp. 1531–1545.
JICSCP-1988-AlkalajS88 #architecture #concurrent: An Architectural Model for a Flat Concurrent Prolog Processor (LA, EYS), pp. 1277–1297.
JICSCP-1988-Bacha88 #design #implementation: Meta Prolog Design and Implementation (HB), pp. 1371–1387.
JICSCP-1988-BrayshawE88 #abstraction: Adding Data and Procedure Abstraction to the Transparent Prolog Machine TPM (MB, ME), pp. 532–547.
JICSCP-1988-BruffaertsH88 #proving: Proof Trees for Negation as Failure: Yet Another Prolog Meta-Interpreter (AB, EH), pp. 343–358.
JICSCP-1988-Docker88 #analysis #implementation #named: SAME — A Structured Analysis Tool and its Implementation in Prolog (TWGD), pp. 82–95.
JICSCP-1988-Fribourg88 #induction #source code: Equivalence-Preserving Transformations of Inductive Properties of Prolog Programs (LF), pp. 893–908.
JICSCP-1988-Kluzniak88 #garbage collection: Compile Time Garbage Collection for Ground Prolog (FK), pp. 1490–1505.
JICSCP-1988-KondohC88 #metaprogramming: Macro Processing in Prolog (SiK, TC), pp. 466–480.
JICSCP-1988-KurosawaYAB88 #architecture #performance: Instruction Architecture for a High Performance Integrated Prolog Processor IPP (KiK, SY, SA, TB), pp. 1506–1530.
JICSCP-1988-McCroskyK88 #array #using: Improving First-Class Array Expressions Using Prolog (CM, AJK), pp. 18–25.
JICSCP-1988-NadathurM88 #overview: An Overview of λ-PROLOG (GN, DM), pp. 810–827.
JICSCP-1988-Naish88: Parallelizing NU-Prolog (LN), pp. 1546–1564.
JICSCP-1988-PereiraC88 #debugging #framework: A Framework for Prolog Debugging (LMP, MC), pp. 481–495.
JICSCP-1988-Plummer88 #debugging #named: Coda: An Extended Debugger for PROLOG (DP), pp. 496–511.
JICSCP-1988-Reintjes88 #design: A VLSI Design Environment in PROLOG (PBR), pp. 70–81.
JICSCP-1988-Shintani88 #performance: A Fast Prolog-Based Production System KORE/IE (TS), pp. 26–41.
JICSCP-1988-SmithL88 #interpreter: A Simple Near-Horn Prolog Interpreter (BTS, DWL), pp. 794–809.
JICSCP-1988-SterlingL88: Composing Prolog Meta-Interpreters (LS, AL), pp. 386–403.
JICSCP-1988-StormonBOR88 #agile #architecture #execution #memory management: An Architecture Based on Content-Addressable Memory for the Rapid Execution of Prolog (CDS, MRB, JVO, DFR), pp. 1448–1473.
JICSCP-1988-Waern88 #abstract interpretation #implementation: An Implementation Technique for the Abstract Interpretation of Prolog (AW), pp. 700–710.
JICSCP-1988-XuW88 #type inference: A Type Inference System for Prolog (JX, DSW), pp. 604–619.
LICS-1988-Baudinet #approach #proving #semantics #source code #termination: Proving Termination Properties of Prolog Programs: A Semantic Approach (MB), pp. 336–347.
LICS-1988-GerthCLS #concurrent #semantics: Fully Abstract Denotational Semantics for Flat Concurrent Prolog (RG, MC, YL, EYS), pp. 320–335.
SIGIR-1987-WattersSR #prototype #retrieval #towards: Towards an Expert System for Bibliographic Retrieval: A Prolog Prototype (CRW, MAS, WR), pp. 272–281.
ECOOP-1987-MelloN #communication: Objects as Communicating Prolog Units (PM, AN), pp. 181–191.
PLDI-1987-Barklund #performance #source code: Efficient interpretation of Prolog programs (JB), pp. 132–137.
PLDI-1987-Krall #implementation #interpreter #performance: Implementation of a high-speed Prolog interpreter (AK), pp. 125–131.
ASPLOS-1987-BorrielloCDN #case study: RISCs versus CISCs for Prolog: A Case Study (GB, ARC, PBD, MNN), pp. 136–145.
AF-1987-Warren #execution #modelling: Or-Parallel Execution Models of Prolog (DHDW), pp. 243–259.
CFLP-1987-Farkas: LISTLOG - A Prolog Extension for List Processing (ZF), pp. 82–95.
CFLP-1987-PerceboisFDSB #architecture #distributed #graph #multi #simulation: Simulation Results of a Multiprocessor Prolog Architecture Based on a Distributed and/or Graph (CP, IF, ID, CS, BB), pp. 126–139.
CFLP-1987-RoyDW #execution: Improving the Execution Speed of Compiled Prolog with Modes, Clause Selection, and Determinism (PVR, BD, YDW), pp. 111–125.
ICLP-1987-ClarkG87: PARLOG and PROLOG United (KLC, SG), pp. 927–961.
ICLP-1987-GeeMP87 #implementation: Advantages of Implementing PROLOG by Microprogramming a Host General Purpose Computer (JG, SWM, YNP), pp. 1–20.
ICLP-1987-Kluzniak87 #synthesis: Type Synthesis for Ground Prolog (FK), pp. 788–816.
ICLP-1987-LindholmO87 #implementation #performance #semantics: Efficient Implementation of a Defensible Semantics for Dynamic PROLOG Code (TGL, RAO), pp. 21–39.
ICLP-1987-Loveland87: Near-Horn PROLOG (DWL), pp. 456–469.
ICLP-1987-MulderT87 #comparison #performance: A Performance Comparison between PLM and a M68020 PROLOG Processor (HM, ET), pp. 59–73.
ICLP-1987-NaishTR87 #concurrent #database: Concurrent Database Updates in PROLOG (LN, JAT, KR), pp. 178–195.
ICLP-1987-Shapiro87 #algorithm #execution #implementation: An OR-Parallel Execution Algorithm for PROLOG and Its FCP Implementation (EYS), pp. 311–337.
ICLP-1987-Tamaki87 #compilation: Stream-Based Compilation of Ground I/O PROLOG into Committed-Choice Languages (HT), pp. 376–393.
ICLP-1987-Zobel87 #polymorphism #source code: Derivation of Polymorphic Types for PROLOG Programs (JZ), pp. 817–838.
SLP-1987-Ali87 #execution #implementation #parallel: A Method for Implementing Cut in Parallel Execution of Prolog (KAMA), pp. 449–456.
SLP-1987-BarklundM87 #data type: Integrating Complex Data Structures in Prolog (JB, HM), pp. 415–425.
SLP-1987-BruynoogheJCD87 #abstract interpretation #optimisation #source code #towards: Abstract Interpretation: Towards the Global Optimization of Prolog Programs (MB, GJ, AC, BD), pp. 192–204.
SLP-1987-BushCMD87 #experience #hardware #specification: Experience with Prolog as a Hardware Specification Language (WRB, GC, PCM, AMD), pp. 490–498.
SLP-1987-ChenxiYLY87 #database #implementation: Implementation of a Prolog Code Database and Source Database in Compiler-Based Systems (CZ, TY, LL, HY), pp. 398–405.
SLP-1987-DeransartF87: An Operational Formal Definition of PROLOG (PD, GF), pp. 162–172.
SLP-1987-GorlickK87 #source code: Timing Prolog Programs without Clock (MMG, CK), pp. 426–434.
SLP-1987-HausmanCH87 #memory management #multi #performance: OR-Parallel Prolog Made Efficient on Shared Memory Multiprocessors (BH, AC, SH), pp. 69–79.
SLP-1987-HuberV87 #order: Extended Prolog for Order-Sorted Resolution (MH, IV), pp. 34–43.
SLP-1987-KumarL87 #backtracking: An Intelligent Backtracking Scheme for Prolog (VK, YJL), pp. 406–414.
SLP-1987-MannilaU87 #analysis #source code: Flow Analysis of Prolog Programs (HM, EU), pp. 205–214.
SLP-1987-SannellaW87 #calculus #composition #source code: A Calculus for the Construction of Modular Prolog Programs (DS, LAW), pp. 368–378.
SLP-1987-ShenW87 #execution #simulation: A Simulation Study of the Argonne Model for Or-Parallel Execution of Prolog (KS, DHDW), pp. 45–68.
SLP-1987-Takayama87 #compilation #proving #source code: Writing Programs as QJ Proof and Compiling into Prolog Programs (YT), pp. 278–287.
SLP-1987-Warren87 #design #execution #implementation: The SRI Model for Or-Parallel Execution of Prolog: Abstract Design and Implementation Issues (DHDW), pp. 92–102.
OOPSLA-1986-FukunagaH #experience #object-oriented: An Experience with a Prolog-based Object-Oriented Language (KF, SH), pp. 224–231.
ESOP-1986-Boizumault #implementation: A Classical Implementation for Prolog-II (PB), pp. 262–273.
ESOP-1986-MelloN #communication #source code: Programs as Collections of Communicating Prolog Units (PM, AN), pp. 274–288.
ESOP-1986-TanakaK #compilation #concurrent #queue: Compiling Extended Concurrent Prolog — Single Queue Compilation (JT, MK), pp. 301–314.
CADE-1986-KanamoriF #induction #source code #verification: Formulation of Induction Formulas in Verification of Prolog Programs (TK, HF), pp. 281–299.
CADE-1986-Stickel #compilation #implementation #proving #theorem proving: A prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler (MES), pp. 573–587.
ICLP-1986-BowenBCT86 #compilation #design #implementation #incremental #performance: The Design and Implementation of a High-Speed Incremental Portable Prolog Compiler (KAB, KAB, IC, AKT), pp. 650–656.
ICLP-1986-Buettner86 #decompiler #performance: Fast Decompilation of Compiled Prolog Clauses (KAB), pp. 663–670.
ICLP-1986-Chikayama86 #architecture #implementation #programming: Prolog Programming Environments: Architecture and Implementation (TC), pp. 552–553.
ICLP-1986-FujitaKTM86 #compilation #logic programming #named #programming language: Tokio: Logic Programming Language Based on Temporal Logic and its Compilation to Prolog (MF, SK, HT, TMO), pp. 695–709.
ICLP-1986-Gupta86 #generative: Test-pattern Generation for VLSI Circuits in a Prolog Environment (RG), pp. 528–535.
ICLP-1986-KanamoriS86 #execution #source code #using #verification: Verification of Prolog Programs Using an Extension of Execution (TK, HS), pp. 475–489.
ICLP-1986-Kursawe86 #how: How to Invent a Prolog Machine (PK), pp. 134–148.
ICLP-1986-MahlerSS86 #approach: A New Approach for Intruducing Prolog to Naive Users (OM, ZS, EYS), pp. 544–551.
ICLP-1986-McCord86 #design: Design of a Prolog-Based Machine Translation System (MCM), pp. 350–374.
ICLP-1986-Mellish86 #abstract interpretation #source code: Abstract Interpretation of Prolog Programs (CM), pp. 463–474.
ICLP-1986-MoffatG86 #persistent: Interfacing Prolog to a Persistent Data Store (DSM, PMDG), pp. 577–584.
ICLP-1986-Moss86: Cut and Paste — defining the impure Primitives of Prolog (CM), pp. 686–694.
ICLP-1986-Naish86 #quantifier: Negation and Quantifiers in NU-Prolog (LN), pp. 624–634.
ICLP-1986-PereiraMCA86 #backtracking #distributed: Delta Prolog: A Distributed Backtracking Extension with Events (LMP, LM, JCC, JNA), pp. 69–83.
ICLP-1986-PooleG86: Gracefully adding negation and disjunction to Prolog (DP, RG), pp. 635–641.
ICLP-1986-RamamohanaraoS86 #database #scalability: A Superimposed Codeword Indexing Scheme for Very Large Prolog Databases (KR, JS), pp. 569–576.
ICLP-1986-RawlingsTNFS86 #using: Using Prolog to Represent and Reason about Protein Structure (CJR, WRT, JN, JF, MJES), pp. 536–543.
ICLP-1986-Robinson86 #memory management #pattern matching: A Prolog Processor Based on a Pattern Matching Memory Device (IR), pp. 172–179.
ICLP-1986-Tick86 #lisp #memory management #performance #source code: Memory Performance of Lisp and Prolog Programs (ET), pp. 642–649.
ICLP-1986-WarrenD86 #detection #functional #optimisation: Detection and Optimization of Functional Computations in Prolog (DSW, SKD), pp. 490–504.
ICLP-1986-YangA86 #logic #named #parallel: P-Prolog: A Parallel Logic Language Based on Exclusive Relation (RY, HA), pp. 255–269.
SLP-1986-BarklundM86 #garbage collection #source code: Garbage Cut for Garbage Collection of Iterative Prolog Programs (JB, HM), pp. 276–283.
SLP-1986-Bocca86 #named #relational: EDUCE: A Marriage of Convenience: Prolog and a Relational DBMS (JBB), pp. 36–45.
SLP-1986-BorgwardtR86 #backtracking #distributed: Distributed Semi-intelligent Backtracking for a Stack-based AND-parallel Prolog (PB, DR), pp. 211–222.
SLP-1986-Debray86: Register Allocation in a Prolog Machine (SKD), pp. 267–275.
SLP-1986-DebrayW86 #automation #source code: Automatic Mode Inference for Prolog Programs (SKD, DSW), pp. 78–88.
SLP-1986-HoddinottE86 #axiom #named #similarity: PROLOG: Subsumption of Equality Axioms by the Homogeneous Form (PH, EWE), pp. 115–126.
SLP-1986-MannilaU86 #implementation #representation: Timestamped Term Representation for Implementing Prolog (HM, EU), pp. 159–165.
SLP-1986-RossR86 #memory management: Paging Strategy for Prolog Based Dynamic Virtual Memory (MLR, KR), pp. 46–57.
SIGMOD-1985-AcharyaB #database #transaction: Transaction Restarts in Prolog Database Systems (SA, GNB), pp. 364–373.
SIGMOD-1985-Gray #database #performance: Efficient Prolog Access to CODASYL and FDM Databases (PMDG), pp. 437–443.
FPCA-1985-Debray85 #optimisation #recursion #source code: Optimizing Almost-Tail-Recursive Prolog Programs (SKD), pp. 204–219.
ICSE-1985-BuhrWKLL #design #multi #tool support: Experiments with Prolog Design Descriptions and Tools in CAEDE: An Iconic Design Environment for Multitasking, Embdedded Systems (RJAB, CMW, GMK, KVDL, DGL), pp. 62–67.
ICSE-1985-HattoriKW #ada #comparison #lisp #programming: A Comparison of Lisp, Prolog, and Ada Programming Productivity an AI Areas (FH, KK, TW), pp. 285–291.
ICSE-1985-PeschSSS #generative #testing #using: Test Case Generation Using Prolog (HP, PS, HS, APS), pp. 252–258.
CSE-1985-BougeCFG #algebra #generative #specification #testing: Application of Prolog to Test Sets Generation from Algebraic Specifications (LB, NC, LF, MCG), pp. 261–275.
CSE-1985-HsiangS #data type #reasoning: A PROLOG Environment for Developing and Reasoning about Data Types (JH, MKS), pp. 276–293.
SLP-1985-BowenW85: A Meta-Level Extension of Prolog (KAB, TW), pp. 48–53.
SLP-1985-Carlsson85 #lisp: A Microcoded Unifier for Lisp Machine Prolog (MC), pp. 162–171.
SLP-1985-ChangD85 #analysis #backtracking #dependence: Semi-Intelligent Backtracking of Prolog Based on Static Data Dependency Analysis (JHC, AMD), pp. 10–21.
SLP-1985-ChomickiM85 #programming #scalability #source code #towards: Towards a Programming Environment for Large Prolog Programs (JC, NHM), pp. 230–241.
SLP-1985-LeeG85 #concurrent #multi: Concurrent Prolog in a Multiprocess Environment (RKSL, RG), pp. 100–109.
SLP-1985-MiyazakiTC85 #concurrent #implementation: A Sequential Implementation of Concurrent Prolog Based on the Shallow Binding Scheme (TM, AT, TC), pp. 110–118.
SLP-1985-Naish85: All Solutions Predicates in Prolog (LN), pp. 73–77.
SLP-1985-OKeefe85 #on the #tool support: On the Treatment of Cuts in Prolog Source-Level Tools (RAO), pp. 68–72.
SLP-1985-PittomvilsBW85 #garbage collection #realtime #towards: Towards a Real-Time Garbage Collector for Prolog (EP, MB, YDW), pp. 185–198.
SLP-1985-SawamuraT85 #optimisation #recursion: Recursive Unsolvability of Determinacy, Solvable Cases of Determinancy and their Applications to Prolog Optimization (HS, TT), pp. 200–207.
SLP-1985-UedaC85 #compilation #concurrent: Concurrent Prolog Compiler on Top of Prolog (KU, TC), pp. 119–126.
SIGMOD-1984-JarkeCV #optimisation #query #relational: An Optimizing Prolog Front-End to a Relational Query System (MJ, JC, YV), pp. 296–306.
VLDB-1984-Woehl #automation #classification #database #documentation #relational: Automatic Classification of Office Documents by Coupling Relational Data Bases and PROLOG Expert Systems (KW), pp. 529–532.
POPL-1984-Shapiro #concurrent #programming: Systems Programming in Concurrent Prolog (EYS), pp. 93–105.
ICSE-1984-AzemaJSM #distributed #petri net #specification #using #verification: Specification and Verification of Distributed Systems Using PROLOG Interpreded Petri Nets (PA, GJ, ES, MM), pp. 510–519.
ILPC-1984-BekkersCRU84 #interpreter #memory management: A Memory Management Machine for Prolog Interpreter (YB, BC, OR, LU), pp. 343–353.
ILPC-1984-BoscoGG84 #concurrent #logic #process #specification #verification: A Prolog System for the Verification of Concurrent Processes Against Temporal Logic Specifications (PGB, GG, EG), pp. 219–229.
ILPC-1984-EmdenL84 #logic #re-engineering: A Logical Reconstruction of Prolog II (MHvE, JWL), pp. 35–40.
ILPC-1984-HirakawaCF84 #concurrent #lazy evaluation: Eager and Lazy Enumerations in Concurrent Prolog (HH, TC, KF), pp. 89–100.
ILPC-1984-Kacsuk84 #data flow #interpreter #parallel: A Highly Parallel Prolog Interpreter Based on the Generalized Data Flow Model (PK), pp. 195–205.
ILPC-1984-KaleW84 #architecture: A Class of Architectures for a Prolog Machine (LVK, DSW), pp. 171–182.
ILPC-1984-Levy84 #algorithm #concurrent #unification: A Unification Algorithm for Concurrent Prolog (JL), pp. 333–341.
ILPC-1984-Nilsson84 #optimisation: Prolog as a Tool for Optimizing Prolog Unifiers (MN), pp. 13–21.
ILPC-1984-Pique84 #equation: Drawing Trees and their Equations in Prolog (JFP), pp. 23–33.
ILPC-1984-SabbatelDIN84 #database #unification: Unification for a Prolog Data Base Machine (GBS, WD, JCI, GTN), pp. 207–217.
SLP-1984-Borgwardt84 #parallel #stack #using: Parallel Prolog Using Stack Segements on Shared-Memory Multiprocessors (PB), pp. 2–11.
SLP-1984-Carlsson84 #functional #implementation #on the #programming: On Implementing Prolog in Functional Programming (MC), pp. 154–159.
SLP-1984-Gelernter84 #concurrent #programming: A Note on Systems Programming in Concurrent Prolog (DG), pp. 76–82.
SLP-1984-HellersteinS84 #algorithm #concurrent #experience #implementation #parallel: Implementing Parallel Algorithms in Concurrent Prolog: The MAXFLOW Experience (LH, EYS), pp. 99–115.
SLP-1984-JonesM84 #development #semantics: Stepwise Development of Operational and Denotational Semantics for Prolog (NDJ, AM), pp. 281–288.
SLP-1984-Mishra84 #formal method #towards: Towards a Theory of Types in Prolog (PM), pp. 289–298.
SLP-1984-Nakagawa84 #parallel #set: AND Parallel PROLOG with Divided Assertion Set (HN), pp. 22–28.
SLP-1984-Nakashima84 #information management #representation: Knowledge representation in Prolog/KR (HN), pp. 126–130.
SLP-1984-Plaisted84 #problem: The Occur-Check Problem in Prolog (DAP), pp. 272–280.
SLP-1984-ShapiroM84 #concurrent #implementation #self #specification: Fair, Biased, and Self-Balancing Merge Operators: Their Specification and Implementation in Concurrent Prolog (EYS, CM), pp. 83–90.
SLP-1984-Stickel84 #proving #theorem proving: A Prolog Technology Theorem Prover (MES), pp. 211–217.
SLP-1984-TamuraK84 #implementation #parallel: Implementing Parallel Prolog on a Multiprocessor Machine (NT, YK), pp. 42–48.
SLP-1984-TickW84 #pipes and filters #towards: Towards a Pipelined Prolog Processor (ET, DHDW), pp. 29–40.
SLP-1984-Warren84 #flexibility #memory management #performance: Efficient Prolog Memory Management for Flexible Control Strategies (DSW), pp. 198–202.
SLP-1984-WarrenADK84 #distributed #network #source code: Executing Distributed Prolog Programs on a Broadcast Network (DSW, MA, SKD, LVK), pp. 12–21.
SLP-1984-WiseP84 #word: Indexing Prolog Clauses via Superimposed Code Words and Filed Encoded Words (MJW, DMWP), pp. 203–210.
SLP-1984-Zaniolo84 #object-oriented #programming: Object-Oriented Programming in Prolog (CZ), pp. 265–270.
RE-1983-Schnupp #german: Prolog als Spezifikations- und Modellierungswerkzeug (PS), pp. 173–182.
LFP-1982-Gutierrez #lisp: Prolog Compared with Lisp (CG), pp. 143–149.
LFP-1982-Moss #how #using: How to Define a Language Using PROLOG (CDSM), pp. 67–73.
LFP-1982-Wise #data-driven #parallel: A Parallel Prolog: The Construction of a Data Driven Model (MJW), pp. 56–66.
POPL-1982-Komorowski #data type #implementation #partial evaluation: Partial Evaluation as a Means for Inferencing Data Structures in an Applicative Language: A Theory and Implementation in the Case of Prolog (HJK), pp. 255–267.
ILPC-1982-Bruynooghe82 #garbage collection: A Note on Garbage-Collection in Prolog Interpreters (MB), pp. 52–55.
ILPC-1982-Bruynooghe82a #reliability #source code: Adding Redundancy to Obtain more Reliable and Readable Prolog Programs (MB), pp. 129–133.
ILPC-1982-Emden82 #algorithm #source code: An Algorithm for Interpreting Prolog Programs (MHvE), pp. 56–64.
ILPC-1982-FurukawaNM82 #concurrent #interpreter #programming: Prolog Interpreter Based on Concurrent Programming (KF, KN, YM), pp. 38–44.
ILPC-1982-Grumbach82 #information management: Knowledge Acquisition in Prolog (AG), pp. 78–84.
ILPC-1982-HirschmanP82 #strict: Restriction Grammar in Prolog (LH, KP), pp. 85–90.
ILPC-1982-Kahn82 #lisp #source code: A Partial Evaluator of Lisp Programs Written in Prolog (KMK), pp. 19–25.
ILPC-1982-MaluszynskiN82 #comparison #logic programming #programming language: A Comparison of the Logic Programming Language Prolog with Two-levels Grammars (JM, JFN), pp. 193–199.
ILPC-1982-MarkuszK82 #design #programming: A Design Methodology in Prolog Programming (ZM, AAK), pp. 139–145.
ILPC-1982-Nakashima82 #named: Prolog/KR — Language Features (HN), pp. 65–70.
ILPC-1982-PerceboisS82: A Lisp-machine to Implement Prolog (CP, JPS), pp. 45–51.
ILPC-1982-PereiraP82 #implementation #scalability: A Prolog Implementation of a Large System on a Small Machine (LMP, AP), pp. 225–229.
ILPC-1982-RoachF82 #migration #simulation: A Prolog Simulation of Migration Decision Making in a Less Developed Country (JWR, TDF), pp. 110–115.
ILPC-1982-Sato82 #semantics #source code: Negation and Semantics of Prolog Programs (TS), pp. 169–174.
ILPC-1982-SebelikS82 #graph #source code: Graphs as Data in Prolog Programs (JS, PS), pp. 105–109.
CADE-1980-BelovariC #generative #integration: Generating Contours of Integration: An Application of Prolog in Symbolic Computing (GB, JAC), pp. 14–23.