BibSLEIGH — logic programming tag

logic programming

logic programming

Tag #logic programming

1299 papers:

CIKM-2019-BremenDJ #probability #query: Ontology-Mediated Queries over Probabilistic Data via Probabilistic Logic Programming (TvB, AD, JCJ), pp. 2437–2440.
PADL-2019-AriasC #composition #evaluation #incremental #using: Incremental Evaluation of Lattice-Based Aggregates in Logic Programming Using Modular TCLP (JA, MC), pp. 98–114.
PADL-2019-Lierler #equivalence #first-order #source code: Strong Equivalence and Program's Structure in Arguing Essential Equivalence Between First-Order Logic Programs (YL), pp. 1–18.
ICSE-2019-Sivaraman0BK #code search #induction: Active inductive logic programming for code search (AS, TZ0, GVdB, MK), pp. 292–303.
ICFP-2018-StampoulisC #functional #higher-order #learning #prolog #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.
LOPSTR-2018-TroumpoukisC #higher-order #source code: Predicate Specialization for Definitional Higher-Order Logic Programs (AT, AC), pp. 132–147.
PADL-2018-DylusCT #functional #probability: Probabilistic Functional Logic Programming (SD, JC, FT), pp. 3–19.
PADL-2018-GermanoCP #ide #named: LoIDE: A Web-Based IDE for Logic Programming Preliminary Report (SG, FC, EP), pp. 152–160.
PPDP-2018-MadsenL #parametricity: Implicit Parameters for Logic Programming (MM, OL), p. 14.
CASE-2018-HuaH #concept #induction #learning #semantics: Concept Learning in AutomationML with Formal Semantics and Inductive Logic Programming (YH, BH), pp. 1542–1547.
PADL-2017-AntoyH #functional #nondeterminism #source code: Eliminating Irrelevant Non-determinism in Functional Logic Programs (SA, MH), pp. 1–18.
PPDP-2017-MesnardPV #constraints #unification: Selective unification in constraint logic programming (FM, ÉP, GV), pp. 115–126.
LOPSTR-2016-KomendantskayaJ: A Productivity Checker for Logic Programming (EK, PJ, MS0), pp. 168–186.
LOPSTR-2016-MesnardPV #on the #source code #testing #unification: On the Completeness of Selective Unification in Concolic Testing of Logic Programs (FM, ÉP, GV), pp. 205–221.
LOPSTR-2016-MorenoPRV #execution #fuzzy #source code #symbolic computation: Symbolic Execution and Thresholding for Efficiently Tuning Fuzzy Logic Programs (GM, JP, JAR, GV), pp. 131–147.
LOPSTR-2016-Saenz-Perez #sql: Intuitionistic Logic Programming for SQL (FSP), pp. 293–308.
PADL-2016-JelinekB #array #constraints #using: Using Constraint Logic Programming to Schedule Solar Array Operations on the International Space Station (JJ, RB), pp. 3–12.
PPDP-2016-CharalambidisRT #higher-order #representation: Higher-order logic programming: an expressive language for representing qualitative preferences (AC, PR, AT), pp. 24–37.
LOPSTR-2015-Miller #proving: Proof Checking and Logic Programming (DM0), pp. 3–17.
LOPSTR-2015-Seki #on the #source code: On Dual Programs in Co-Logic Programming (HS), pp. 21–35.
PADL-2015-CruzR #compilation #linear #on the #source code: On Compiling Linear Logic Programs with Comprehensions, Aggregates and Rule Priorities (FC, RR), pp. 34–49.
PADL-2015-Tarau #combinator #generative #normalisation #on the #type inference: On Logic Programming Representations of λ Terms: de Bruijn Indices, Compression, Type Inference, Combinatorial Generation, Normalization (PT), pp. 115–131.
PPDP-2015-BartakDZ #modelling #on the #problem: On modeling planning problems in tabled logic programming (RB, AD, NFZ), pp. 31–42.
PPDP-2015-Miller #proving: Proof checking and logic programming (DM), p. 18.
PPDP-2015-RondogiannisT #using: Expressing preferences in logic programming using an infinite-valued logic (PR, AT), pp. 208–219.
ICLP-2015-CruzRG #data-driven #parallel #source code #thread: Thread-Aware Logic Programming for Data-Driven Parallel Programs (FC, RR, SCG), pp. 191–203.
ICLP-2015-Dovier #bisimulation: Logic Programming and Bisimulation (AD), pp. 32–45.
ICLP-2015-JohannKK: Structural Resolution for Logic Programming (PJ, EK, VK), pp. 87–99.
ICLP-2015-VolkerI #automaton: Logic Programming for Cellular Automata (MV, KI), pp. 128–139.
ICLP-2015-YangSZ #bottom-up #evaluation #manycore #parallel #source code: Parallel Bottom-Up Evaluation of Logic Programs: DeALS on Shared-Memory Multicore Machines (MY, AS, CZ), pp. 6–17.
ICLP-2015-Zaniolo #algorithm #source code: Expressing and Supporting Efficiently Greedy Algorithms as Locally Stratified Logic Programs (CZ), pp. 287–300.
ICLP-J-2015-BlackmoreRE #approach #compilation #effectiveness #embedded #predict: A logic programming approach to predict effective compiler settings for embedded software (CB, OR, KE), pp. 481–494.
ICLP-J-2015-BogaertsB #approximate #compilation #fixpoint #source code #using: Knowledge compilation of logic programs using approximation fixpoint theory (BB, GVdB), pp. 464–480.
ICLP-J-2015-CristiaRF #constraints #set: Adding partial functions to Constraint Logic Programming with sets (MC, GR, CSF), pp. 651–665.
ICLP-J-2015-FichteTW #source code: Dual-normal logic programs — the forgotten class (JKF, MT, SW), pp. 495–510.
ICLP-J-2015-MesnardPV #testing: Concolic testing in logic programming (FM, ÉP, GV), pp. 711–725.
ICLP-J-2015-ZhouBD: Planning as tabled logic programming (NFZ, RB, AD), pp. 543–558.
VLDB-2015-ZengPP14 #induction #named #scalability: QuickFOIL: Scalable Inductive Logic Programming (QZ, JMP, DP), pp. 197–208.
FLOPS-2014-DunduaFKM #constraints #re-engineering #semantics: Constraint Logic Programming for Hedges: A Semantic Reconstruction (BD, MF, TK, MM), pp. 285–301.
KR-2014-AsuncionZZ #first-order #semantics #source code: Logic Programs with Ordered Disjunction: First-Order Semantics and Expressiveness (VA, YZ, HZ).
KR-2014-CharalambidisR #higher-order: Constructive Negation in Extensional Higher-Order Logic Programming (AC, PR).
KR-2014-ShenZ #canonical #source code: Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas (YS, XZ).
LOPSTR-2014-AriasLM #compilation #constraints #declarative: Declarative Compilation for Constraint Logic Programming (EJGA, JL, JMC), pp. 299–316.
LOPSTR-2014-ChowdhuryLCKY #approximate #case study #polynomial #semantics #source code: Polynomial Approximation to Well-Founded Semantics for Logic Programs with Generalized Atoms: Case Studies (MSC, FL, WC, AK, JHY), pp. 279–296.
LOPSTR-2014-Drabent #on the #source code: On Completeness of Logic Programs (WD), pp. 261–278.
PADL-2014-AreiasR #correctness #on the #performance #source code: On the Correctness and Efficiency of Lock-Free Expandable Tries for Tabled Logic Programs (MA, RR), pp. 168–183.
PADL-2014-SaptawijayaP #modelling #towards: Towards Modeling Morality Computationally with Logic Programming (AS, LMP), pp. 104–119.
PEPM-2014-HanusS #analysis #composition #functional #source code: A modular and generic analysis server system for functional logic programs (MH, FS), pp. 181–188.
PPDP-2014-CruzRG #design #implementation #linear #parallel #source code #thread #virtual machine: Design and Implementation of a Multithreaded Virtual Machine for Executing Linear Logic Programs (FC, RR, SCG), pp. 43–54.
PPDP-2014-Haemmerle #constraints #on the: On Combining Backward and Forward Chaining in Constraint Logic Programming (RH), pp. 213–224.
PPDP-2014-SchrijversWDD #functional #heuristic #implementation #specification: Heuristics Entwined with Handlers Combined: From Functional Specification to Logic Programming Implementation (TS, NW, BD, BD), pp. 259–270.
ASE-2014-DeweyRH #constraints #fuzzing #using: Language fuzzing using constraint logic programming (KD, JR, BH), pp. 725–730.
ICLP-J-2014-BartakZ #problem #using: Using Tabled Logic Programming to Solve the Petrobras Planning Problem (RB, NFZ), pp. 697–710.
ICLP-J-2014-BellodiLRCZ #probability: Lifted Variable Elimination for Probabilistic Logic Programming (EB, EL, FR, VSC, RZ), pp. 681–695.
ICLP-J-2014-CabalarFF #graph #source code: Causal Graph Justifications of Logic Programs (PC, JF, MF), pp. 603–618.
ICLP-J-2014-CharalambidisER #higher-order #semantics: Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation (AC, ZÉ, PR), pp. 725–737.
ICLP-J-2014-CruzRGP #concurrent #graph #linear #programming language: A Linear Logic Programming Language for Concurrent Programming over Graph Structures (FC, RR, SCG, FP), pp. 493–507.
ICLP-J-2014-GelfondZ #source code: Vicious Circle Principle and Logic Programs with Aggregates (MG, YZ), pp. 587–601.
ICLP-J-2014-LagerW #named #web: Pengines: Web Logic Programming Made Easy (TL, JW), pp. 539–552.
ICLP-J-2014-SerranoLH #abstract interpretation #analysis #resource management #source code #using: Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types (AS, PLG, MVH), pp. 739–754.
KEOD-2013-Cruz-FilipeNG #multi #ontology #source code: Patterns for Interfacing between Logic Programs and Multiple Ontologies (LCF, IN, GG), pp. 58–69.
LOPSTR-2013-Seki #model checking #source code: Extending Co-logic Programs for Branching-Time Model Checking (HS), pp. 127–144.
PADL-2013-AngelopoulosCAWCW #functional #statistics: Integrative Functional Statistics in Logic Programming (NA, VSC, JA, JW, RC, LW), pp. 190–205.
PADL-2013-CastroMM #java #named: LogicObjects: Enabling Logic Programming in Java through Linguistic Symbiosis (SC, KM, PM), pp. 26–42.
PADL-2013-LiangK #automation #named #scalability #source code: Terminyzer: An Automatic Non-termination Analyzer for Large Logic Programs (SL, MK), pp. 173–189.
PADL-2013-Moura #implementation #induction #performance: A Portable and Efficient Implementation of Coinductive Logic Programming (PM), pp. 77–92.
PPDP-2013-CalauttiGT #decidability #detection #source code: Detecting decidable classes of finitely ground logic programs with function symbols (MC, SG, IT), pp. 239–250.
PPDP-2013-ChristiansenHRS #encapsulation #functional #semantics #source code: A semantics for weakly encapsulated search in functional logic programs (JC, MH, FR, DS), pp. 49–60.
ICLP-J-2013-GangeNSSS #constraints: Failure tabled constraint logic programming by interpolation (GG, JAN, PS, HS, PJS), pp. 593–607.
ICLP-J-2013-GrecoMT #bottom-up #evaluation #termination: Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments (SG, CM, IT), pp. 737–752.
ICLP-J-2013-LiangK #analysis #scalability #source code: A practical analysis of non-termination in large logic programs (SL, MK), pp. 705–719.
ICLP-J-2013-YouZZ #quantifier #source code: Disjunctive logic programs with existential quantification in rule heads (JHY, HZ, YZ), pp. 563–578.
FLOPS-2012-SaeedloeiG #constraints #induction: Coinductive Constraint Logic Programming (NS, GG), pp. 243–259.
KR-2012-Feier #reasoning #source code #worst-case: Worst-Case Optimal Reasoning with Forest Logic Programs (CF).
KR-2012-Lifschitz #source code: Logic Programs with Intensional Functions (VL).
KR-2012-WangZZZ #equivalence #source code: Forgetting in Logic Programs under Strong Equivalence (YW, YZ, YZ, MZ).
LOPSTR-2012-DandoisV #semantics #source code: Semantic Code Clones in Logic Programs (CD, WV), pp. 35–50.
LOPSTR-2012-GieslSSEF #evaluation #graph #source code #symbolic computation #term rewriting: Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs (JG, TS, PSK, FE, CF), p. 1.
LOPSTR-2012-RojasG #constraints #framework #generative #testing: A Framework for Guided Test Case Generation in Constraint Logic Programming (JMR, MGZ), pp. 176–193.
LOPSTR-2012-Seki #program transformation #proving #source code: Proving Properties of Co-logic Programs with Negation by Program Transformations (HS), pp. 213–227.
PADL-2012-AntoyH #contract #functional #specification: Contracts and Specifications for Functional Logic Programming (SA, MH), pp. 33–47.
PEPM-2012-Lopez-FraguasMR #functional: Well-typed narrowing with extra variables in functional-logic programming (FJLF, EMM, JRH), pp. 83–92.
PPDP-2012-GieslSSEF #evaluation #graph #source code #symbolic computation #term rewriting: Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs (JG, TS, PSK, FE, CF), pp. 1–12.
ICLP-2012-0002KZPM #approach #data access #rdf: A Logic Programming approach for Access Control over RDF (NL, SK, AZ, AP, AM), pp. 381–392.
ICLP-2012-AriasL: Logic Programming in Tabular Allegories (EJGA, JL), pp. 334–347.
ICLP-2012-CattafiHGNM #constraints #health #performance #quality: Improving Quality and Efficiency in Home Health Care: an application of Constraint Logic Programming for the Ferrara NHS unit (MC, RH, MG, MN, FM), pp. 415–424.
ICLP-2012-GrecoST #on the #source code #termination: On the Termination of Logic Programs with Function Symbols (SG, FS, IT), pp. 323–333.
ICLP-2012-Lifschitz #source code: Two-Valued Logic Programs (VL), pp. 259–266.
ICLP-2012-NievesL #source code: Possibilistic Nested Logic Programs (JCN, HL), pp. 267–276.
ICLP-2012-VirsedaMT #concurrent #constraints #functional #semantics: A Concurrent Operational Semantics for Constraint Functional Logic Programming (RdVV, FPM, MMGT), pp. 154–163.
ICLP-2012-ZomboriCS #constraints #static typing #type inference #using: Static Type Inference for the Q language using Constraint Logic Programming (ZZ, JC, PS), pp. 119–129.
ICLP-J-2012-Cervesato #compilation #source code: An Improved Proof-Theoretic Compilation of Logic Programs (IC), pp. 639–657.
ICLP-J-2012-GorlinRS #model checking #probability: Model checking with probabilistic tabled logic programming (AG, CRR, SAS), pp. 681–700.
ICLP-J-2012-IslamRR #probability #random #source code: Inference in probabilistic logic programs with continuous random variables (MAI, CRR, IVR), pp. 505–523.
ICLP-J-2012-Martin #semantics #source code: Contextual hypotheses and semantics of logic programs (EM), pp. 843–887.
ICLP-J-2012-Vidal #independence #partial evaluation #source code: Annotation of logic programs for independent AND-parallelism by partial evaluation (GV), pp. 583–600.
TAP-2012-SenniF #constraints #data type #generative #testing #using: Generation of Test Data Structures Using Constraint Logic Programming (VS, FF), pp. 115–131.
CSEET-2011-GalvaoARAFG #education #learning #process: A proposal for an educational system service to support teaching/learning process for logic programming (ERDG, RRdA, CMOR, SCA, FF, VCG), p. 556.
LOPSTR-2011-DandoisV #detection #how #source code: Clones in Logic Programs and How to Detect Them (CD, WV), pp. 90–105.
LOPSTR-2011-Gallagher #analysis #source code #using: Analysis of Logic Programs Using Regular Tree Languages — (JPG), pp. 1–3.
LOPSTR-2011-Seki #proving #source code: Proving Properties of Co-Logic Programs by Unfold/Fold Transformations (HS), pp. 205–220.
PADL-2011-MeraTLH #debugging #performance #profiling #runtime #source code: Profiling for Run-Time Checking of Computational Properties and Performance Debugging in Logic Programs (EM, TT, PLG, MVH), pp. 38–53.
PEPM-2011-Caballero #functional #program transformation #source code: A program transformation for returning states in functional-logic programs (RC), pp. 111–120.
PEPM-2011-Martin-Martin #functional: Type classes in functional logic programming (EMM), pp. 121–130.
PPDP-2011-NigamJLS #distributed #incremental #maintenance #source code: Maintaining distributed logic programs incrementally (VN, LJ, BTL, AS), pp. 125–136.
CSL-2011-KomendantskayaP #algebra: Coalgebraic Derivations in Logic Programming (EK, JP), pp. 352–366.
ICLP-2011-Bulwahn #generative #testing: Smart test data generators via logic programming (LB), pp. 139–150.
ICLP-2011-ChishamPSW #named #repository #using #web #web service: CDAOStore: A Phylogenetic Repository Using Logic Programming and Web Services (BC, EP, TCS, BW), pp. 209–219.
ICLP-2011-Herranz-NievaM #object-oriented #source code #specification #synthesis: Synthesis of Logic Programs from Object-Oriented Formal Specifications (ÁHN, JM), pp. 95–105.
ICLP-2011-Krennwallner #composition #source code: Promoting Modular Nonmonotonic Logic Programs (TK), pp. 274–279.
ICLP-2011-Kriener #reasoning #source code: Correct Reasoning about Logic Programs (JK), pp. 280–283.
ICLP-2011-Simko #order: Accepting the natural order of rules in a logic program with preferences (AS), pp. 284–289.
ICLP-J-2011-AreiasR #evaluation #on the #source code: On combining linear-based strategies for tabled evaluation of logic programs (MA, RR), pp. 681–696.
ICLP-J-2011-CruzR #evaluation #performance #retrieval #source code: Efficient instance retrieval of subgoals for subsumptive tabled evaluation of logic programs (FC, RR), pp. 697–712.
ICLP-J-2011-DrescherT #named #prolog: ALPprolog — A new logic programming method for dynamic domains (CD, MT), pp. 451–468.
ICLP-J-2011-VoetsS #analysis #integer #source code: Non-termination analysis of logic programs with integer arithmetics (DV, DDS), pp. 521–536.
ITiCSE-2010-Friese: Measuring of and reacting to learners’ progress in logic programming courses (SF), pp. 152–154.
FLOPS-2010-CaballeroGS #constraints #generative #sql #testing: Applying Constraint Logic Programming to SQL Test Case Generation (RC, YGR, FSP), pp. 191–206.
SPLC-2010-KaratasOD #constraints #feature model #finite #modelling: Mapping Extended Feature Models to Constraint Logic Programming over Finite Domains (ASK, HO, AHD), pp. 286–299.
LOPSTR-2010-BacciC #first-order #functional #source code: Abstract Diagnosis of First Order Functional Logic Programs (GB, MC), pp. 215–233.
LOPSTR-2010-StroderSG #analysis #dependence #source code #termination: Dependency Triples for Improving Termination Analysis of Logic Programs with Cut (TS, PSK, JG), pp. 184–199.
LOPSTR-2010-Vidal #approach #hybrid #partial evaluation #source code: A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs (GV), pp. 200–214.
LOPSTR-2010-VoetsS #analysis #source code #using: Non-termination Analysis of Logic Programs Using Types (DV, DDS), pp. 133–148.
PPDP-2010-SnowBN #approach #metaprogramming: A meta-programming approach to realizing dependently typed logic programming (ZS, DB, GN), pp. 187–198.
ICLP-2010-Alqaddoumi10 #functional #parallel #towards #virtual machine: Towards a Parallel Virtual Machine for Functional Logic Programming (AA), pp. 222–225.
ICLP-2010-CorapiRL10 #abduction #induction: Inductive Logic Programming as Abductive Search (DC, AR, EL), pp. 54–63.
ICLP-2010-Dandois10 #program analysis #source code: Program analysis for code duplication in logic programs (CD), pp. 241–247.
ICLP-2010-Martinez10 #concurrent #constraints #design #implementation #linear #programming language: Design and Implementation of a Concurrent Logic Programming Language with Linear Logic Constraints (TM), pp. 277–280.
ICLP-2010-Near10 #relational #source code #specification: From Relational Specifications to Logic Programs (JPN), pp. 144–153.
ICLP-2010-PereiraP10 #semantics #source code: Tight Semantics for Logic Programs (LMP, AMP), pp. 134–143.
ICLP-2010-RiguzziS10 #reasoning #source code: Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions (FR, TS), pp. 162–171.
ICLP-2010-Saeedloei10 #cyber-physical: Logic Programming Foundations of Cyber-Physical Systems (NS), pp. 289–293.
ICLP-2010-SimariS10 #abduction #probability #source code: Abductive Inference in Probabilistic Logic Programs (GIS, VSS), pp. 192–201.
ICLP-2010-Wernhard10: Circumscription and Projection as Primitives of Logic Programming (CW), pp. 202–211.
ICLP-J-2010-BaralGPS #case study #logic #modelling: Logic programming for finding models in the logics of knowledge and its applications: A case study (CB, GG, EP, TCS), pp. 675–690.
ICLP-J-2010-Delgrande #approach #semantics #set #source code: A program-level approach to revising logic programs under the answer set semantics (JPD), pp. 565–580.
ICLP-J-2010-PettorossiSP #infinity #source code: Transformations of logic programs on infinite lists (AP, VS, MP), pp. 383–399.
ICLP-J-2010-Schneider-KampGSST #analysis #automation #source code #termination: Automated termination analysis for logic programs with cut (PSK, JG, TS, AS, RT), pp. 365–381.
ICLP-J-2010-WangYYS #source code: Loop formulas for description logic programs (YW, JHY, LYY, YDS), pp. 531–545.
ICDAR-2009-SantoshLR #induction #recognition: Inductive Logic Programming for Symbol Recognition (KCS, BL, JPR), pp. 1330–1334.
ICEIS-AIDSS-2009-BombiniMBFE #framework #learning: A Logic Programming Framework for Learning by Imitation (GB, NDM, TMAB, SF, FE), pp. 218–223.
LOPSTR-2009-MinG #induction: Coinductive Logic Programming with Negation (RM, GG), pp. 97–112.
LOPSTR-2009-Schneider-KampGN #dependence #framework #source code #termination: The Dependency Triple Framework for Termination of Logic Programs (PSK, JG, MTN), pp. 37–51.
PADL-2009-PereiraP #modelling #query #source code #top-down: Layered Models Top-Down Querying of Normal Logic Programs (LMP, AMP), pp. 254–268.
PADL-2009-Porto #database #interactive #relational: High-Level Interaction with Relational Databases in Logic Programming (AP), pp. 152–167.
PPDP-2009-AntoyH #functional #set: Set functions for functional logic programming (SA, MH), pp. 73–82.
ICLP-2009-Ashley-Rollman #distributed #research #summary: Research Summary: Logic Programming for Massively Distributed Systems (MPAR), pp. 527–529.
ICLP-2009-BroechelerSS #probability #query #source code #using: Using Histograms to Better Answer Queries to Probabilistic Logic Programs (MB, GIS, VSS), pp. 40–54.
ICLP-2009-CaballeroRR #functional: Qualified Computations in Functional Logic Programming (RC, MRA, CARD), pp. 449–463.
ICLP-2009-ChenJL #source code: Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs (XC, JJ, FL), pp. 130–144.
ICLP-2009-CostaRR #source code: A Term-Based Global Trie for Tabled Logic Programs (JC, JR, RR), pp. 205–219.
ICLP-2009-Dao-TranEFK #composition #revisited: Modular Nonmonotonic Logic Programming Revisited (MDT, TE, MF, TK), pp. 145–159.
ICLP-2009-DelgrandeSTW #semantics #set #source code: Merging Logic Programs under Answer Set Semantics (JPD, TS, HT, SW), pp. 160–174.
ICLP-2009-Fodor #evaluation #research #source code #summary #transaction: Research Summary: Tabled Evaluation for Transaction Logic Programs (PF), pp. 525–526.
ICLP-2009-HolldoblerR #semantics #source code: Logic Programs under Three-Valued Lukasiewicz Semantics (SH, CDPKR), pp. 464–478.
ICLP-2009-Mungall #case study #experience #using: Experiences Using Logic Programming in Bioinformatics (CM), pp. 1–21.
ICLP-2009-Namasivayam #random #source code: Study of Random Logic Programs (GN), pp. 555–556.
ICLP-2009-Simkus #logic: Fusion of Logic Programming and Description Logics (MS), pp. 551–552.
ICLP-2009-SonPS #multi: Logic Programming for Multiagent Planning with Negotiation (TCS, EP, CS), pp. 99–114.
ICLP-2009-Truszczynski #satisfiability #semantics #source code: Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs (MT), pp. 175–189.
ICLP-2009-Voets #analysis #research #source code #summary: Research Summary: Non-termination Analysis of Logic Programs (DV), pp. 553–554.
ICLP-2009-VoetsS #analysis #approach #source code: A New Approach to Non-termination Analysis of Logic Programs (DV, DDS), pp. 220–234.
ICLP-2009-Wan: Belief Logic Programming (HW), pp. 547–548.
ICLP-2009-WanGKFL: Logic Programming with Defaults and Argumentation Theories (HW, BNG, MK, PF, SL), pp. 432–448.
LICS-2009-PfenningS #order #semantics: Substructural Operational Semantics as Ordered Logic Programming (FP, RJS), pp. 101–110.
FLOPS-2008-CaballeroRV #constraints #declarative #functional: Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming (RC, MRA, RdVV), pp. 305–321.
FLOPS-2008-Rodriguez-ArtalejoR #revisited: Quantitative Logic Programming Revisited (MRA, CARD), pp. 272–288.
IFL-2008-BrasselF #functional #lazy evaluation #source code: From Functional Logic Programs to Purely Functional Programs Preserving Laziness (BB, SF), pp. 25–42.
KR-2008-DelgrandeSTW #semantics #set #source code: Belief Revision of Logic Programs under Answer Set Semantics (JPD, TS, HT, SW), pp. 411–421.
KR-2008-FaberTW #equivalence #order #source code: Notions of Strong Equivalence for Logic Programs with Ordered Disjunction (WF, HT, SW), pp. 433–443.
LOPSTR-2008-LeuschelV #partial evaluation #performance #scalability #source code: Fast Offline Partial Evaluation of Large Logic Programs (ML, GV), pp. 119–134.
PADL-2008-CoxN #array #spreadsheet #unification: Unification of Arrays in Spreadsheets with Logic Programming (PTC, PKN), pp. 100–115.
PADL-2008-Marpons-UceroMCHMF #automation #consistency #using: Automatic Coding Rule Conformance Checking Using Logic Programming (GMU, JMC, MC, ÁHN, JJMN, LÅF), pp. 18–34.
PPDP-2008-CaballeroRR #reasoning #similarity: Similarity-based reasoning in qualified logic programming (RC, MRA, CARD), pp. 185–194.
PPDP-2008-Hanus #analysis #functional #source code: Call pattern analysis for functional logic programs (MH), pp. 67–78.
PPDP-2008-Lu #dependence #polymorphism #precise #source code: Inferring precise polymorphic type dependencies in logic programs (LL), pp. 143–151.
ICSE-2008-SankaranarayananIG #induction #library #mining #specification #using: Mining library specifications using inductive logic programming (SS, FI, AG), pp. 131–140.
ICLP-2008-BelhaouariP #approach #automation #constraints #testing: A Constraint Logic Programming Approach to Automated Testing (HB, FP), pp. 754–758.
ICLP-2008-CohenSS #algorithm #source code: Dynamic Programming Algorithms as Products of Weighted Logic Programs (SBC, RJS, NAS), pp. 114–129.
ICLP-2008-Costa: The Life of a Logic Programming System (VSC), pp. 1–6.
ICLP-2008-DeneckerV #integration #knowledge base: Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic (MD, JV), pp. 71–76.
ICLP-2008-MileoMB #approach #monitoring: A Logic Programming Approach to Home Monitoring for Risk Prevention in Assisted Living (AM, DM, RB), pp. 145–159.
ICLP-2008-MontaliTACGLM #declarative #specification #using #verification: Verification from Declarative Specifications Using Logic Programming (MM, PT, MA, FC, MG, EL, PM), pp. 440–454.
ICLP-2008-MuggletonST #bias #declarative #named #using: TopLog: ILP Using a Logic Program Declarative Bias (SM, JCAS, ATN), pp. 687–692.
ICLP-2008-Riguzzi #semantics #source code: Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics (FR), pp. 667–671.
ICLP-2008-Santos #bias #declarative #named #using: TopLog: ILP Using a Logic Program Declarative Bias (JCAS), pp. 818–819.
ICLP-2008-SenniPP #algorithm #constraints #source code: A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs (VS, AP, MP), pp. 284–300.
ICLP-2008-TruszczynskiW #composition #source code: Relativized Hyperequivalence of Logic Programs for Modular Programming (MT, SW), pp. 576–590.
ICLP-2008-VanhoofD #algorithm #source code: An Algorithm for Sophisticated Code Matching in Logic Programs (WV, FD), pp. 785–789.
ICALP-2007-SimonBMG #induction: Co-Logic Programming: Extending Logic Programming with Coinduction (LS, AB, AM, GG), pp. 472–483.
TLCA-2007-LiptonN #constraints #higher-order #programming language #semantics: Higher-Order Logic Programming Languages with Constraints: A Semantics (JL, SN), pp. 272–289.
ICEIS-AIDSS-2007-CaropreseTZ #implementation #reasoning: Implementing Prioritized Reasoning in Logic Programming (LC, IT, EZ), pp. 94–100.
LOPSTR-2007-CasasCH #algorithm #independence #source code #strict: Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs (AC, MC, MVH), pp. 138–153.
LOPSTR-2007-NguyenGSS #analysis #dependence #graph #source code #termination: Termination Analysis of Logic Programs Based on Dependency Graphs (MTN, JG, PSK, DDS), pp. 8–22.
PADL-2007-AlbertGHP #analysis #bytecode #java #source code #using #verification: Verification of Java Bytecode Using Analysis and Transformation of Logic Programs (EA, MGZ, LH, GP), pp. 124–139.
PADL-2007-LiuP #induction: Inductive Logic Programming by Instance Patterns (CL, EP), pp. 230–244.
PEPM-2007-Vidal #partial evaluation #source code #termination: Quasi-terminating logic programs for ensuring the termination of partial evaluation (GV), pp. 51–60.
PPDP-2007-Charatonik #source code: Regular directional types for logic programs (WC), p. 209.
PPDP-2007-FischerK #functional #generative #source code #testing: Systematic generation of glass-box test cases for functional logic programs (SF, HK), pp. 63–74.
PPDP-2007-LiuP #induction: Nonmonotonic inductive logic programming by instance patterns (CL, EP), pp. 187–196.
QAPL-2007-BistarelliMRS #constraints #graph #modelling #multi #using: Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming (SB, UM, FR, FS), pp. 111–127.
SAC-2007-VarroB #automation #induction #model transformation #using: Automating model transformation by example using inductive logic programming (DV, ZB), pp. 978–984.
WRLA-J-2004-Lopez-FraguasRV07 #constraints #functional: A new generic scheme for functional logic programming with constraints (FJLF, MRA, RdVV), pp. 73–122.
ICLP-2007-CabalarPV #source code: Minimal Logic Programs (PC, DP, AV), pp. 104–118.
ICLP-2007-CaballeroRV #constraints #debugging #declarative #functional: Declarative Debugging of Missing Answers in Constraint Functional-Logic Programming (RC, MRA, RdVV), pp. 425–427.
ICLP-2007-CaliL #probability #semantics #source code #web: Tightly Integrated Probabilistic Description Logic Programs for the Semantic Web (AC, TL), pp. 428–429.
ICLP-2007-CzenkoE #trust: Core TuLiP Logic Programming for Trust Management (MC, SE), pp. 380–394.
ICLP-2007-GuptaBMSM #induction: Coinductive Logic Programming and Its Applications (GG, AB, RM, LS, AM), pp. 27–44.
ICLP-2007-JarvisaloO #source code: Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs (MJ, EO), pp. 134–148.
ICLP-2007-LiuPST #constraints #source code: Logic Programs with Abstract Constraint Atoms: The Role of Computations (LL, EP, TCS, MT), pp. 286–301.
ICLP-2007-MancarellaTT #abduction #verification #web: Web Sites Verification: An Abductive Logic Programming Tool (PM, GT, FT), pp. 434–435.
ICLP-2007-Morozov #analysis #design #visual notation: Visual Logic Programming Method Based on Structural Analysis and Design Technique (AAM), pp. 436–437.
ICLP-2007-NavasMLH #analysis #bound #source code: User-Definable Resource Bounds Analysis for Logic Programs (JAN, EM, PLG, MVH), pp. 348–363.
ICLP-2007-OikarinenJ #linear: A Linear Transformation from Prioritized Circumscription to Disjunctive Logic Programming (EO, TJ), pp. 440–441.
ICLP-2007-PettorossiPS #automation #correctness #program transformation #proving: Automatic Correctness Proofs for Logic Program Transformations (AP, MP, VS), pp. 364–379.
ICLP-2007-PietrzakH #automation #fault #source code: Automatic Binding-Related Error Diagnosis in Logic Programs (PP, MVH), pp. 333–347.
ICLP-2007-TarauL #framework #synthesis: A Logic Programming Framework for Combinational Circuit Synthesis (PT, BL), pp. 180–194.
ICLP-2007-Truszczynski #information management #representation: Logic Programming for Knowledge Representation (MT), pp. 76–88.
ICLP-2007-UnelT #approach: Logic Programming Approach to Automata-Based Decision Procedures (GÜ, DT), pp. 165–179.
ICLP-2007-West #animation #programming language #specification #using: The Use of a Logic Programming Language in the Animation of Z Specifications (MMW), pp. 451–452.
ICLP-2007-Wong #equivalence #source code: A Stronger Notion of Equivalence for Logic Programs (KSW), pp. 453–454.
SCAM-2006-HenriksenG #abstract interpretation #source code: Abstract Interpretation of PIC Programs through Logic Programming (KSH, JPG), pp. 184–196.
KR-2006-ChenLWZ #first-order #source code: First-Order Loop Formulas for Normal Logic Programs (YC, FL, YW, MZ), pp. 298–307.
KR-2006-Straccia #query #source code: Query Answering under the Any-World Assumption for Normal Logic Programs (US), pp. 329–339.
KR-2006-Zhang #source code: Computational Properties of Epistemic Logic Programs (YZ), pp. 308–317.
LOPSTR-2006-LeuschelCE #online #partial evaluation #source code #using: Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques (ML, SJC, DE), pp. 43–59.
LOPSTR-2006-SakamaI #source code: Constructing Consensus Logic Programs (CS, KI), pp. 26–42.
LOPSTR-2006-Schneider-KampGST #analysis #automation #source code #term rewriting #termination: Automated Termination Analysis for Logic Programs by Term Rewriting (PSK, JG, AS, RT), pp. 177–193.
PADL-2006-SahaR #evaluation #incremental #prolog #source code: Incremental Evaluation of Tabled Prolog: Beyond Pure Logic Programs (DS, CRR), pp. 215–229.
SAC-2006-PaluPHL #3d #approach #constraints #scalability: A constraint logic programming approach to 3D structure determination of large protein complexes (ADP, EP, JH, YL), pp. 131–136.
ICLP-2006-AntoyH #functional #source code: Overlapping Rules and Logic Variables in Functional Logic Programs (SA, MH), pp. 87–101.
ICLP-2006-CaballeroRV #constraints #declarative #functional: Declarative Diagnosis of Wrong Answers in Constraint Functional-Logic Programming (RC, MRA, RdVV), pp. 421–422.
ICLP-2006-Cheney #semantics #source code: The Semantics of Nominal Logic Programs (JC), pp. 361–375.
ICLP-2006-MantsivodaLM: Logic Programming in Knowledge Domains (AM, VL, AM), pp. 451–452.
ICLP-2006-MeraLPCH #estimation #execution #profiling #static analysis #using: Using Combined Static Analysis and Profiling for Logic Program Execution Time Estimation (EM, PLG, GP, MC, MVH), pp. 431–432.
ICLP-2006-NogueiraA #towards: Towards Temporal Contextual Logic Programming (VN, SA), pp. 439–441.
ICLP-2006-PettorossiPS #constraints #proving #source code: Proving Properties of Constraint Logic Programs by Eliminating Existential Variables (AP, MP, VS), pp. 179–195.
ICLP-2006-Phan #memory management #programming language: Static Memory Management for Logic Programming Languages (QP), pp. 465–466.
ICLP-2006-PontelliS #semantics #set #source code: Justifications for Logic Programs Under Answer Set Semantics (EP, TCS), pp. 196–210.
ICLP-2006-QuintanoR #database #framework #natural language #query #using: Using a Logic Programming Framework to Control Database Query Dialogues in Natural Language (LQ, IPR), pp. 406–420.
ICLP-2006-RamakrishnanRW #deduction #spreadsheet #using: Deductive Spreadsheets Using Tabled Logic Programming (CRR, IVR, DSW), pp. 391–405.
ICLP-2006-Rocha #source code: Handling Incomplete and Complete Tables in Tabled Logic Programs (RR), pp. 427–428.
ICLP-2006-SahaR #algorithm #evaluation #incremental #source code: A Local Algorithm for Incremental Evaluation of Tabled Logic Programs (DS, CRR), pp. 56–71.
ICLP-2006-SilvaC #compilation #design #implementation #optimisation #programming language: The Design and Implementation of the YAP Compiler: An Optimizing Compiler for Logic Programming Languages (AFdS, VSC), pp. 461–462.
ICLP-2006-SimonMBG #induction: Coinductive Logic Programming (LS, AM, AB, GG), pp. 330–345.
ICLP-2006-Wong #source code: Deducing Logic Programs (KSW), pp. 471–472.
LOPSTR-2005-AlbertPG #partial evaluation #source code: Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates (EA, GP, JPG), pp. 115–132.
LOPSTR-2005-AlvezL #algorithm #source code: An Algorithm for Local Variable Elimination in Normal Logic Programs (JÁ, PL), pp. 61–79.
LOPSTR-2005-PasarellaOPN #embedded #semantics #source code: A Transformational Semantics of Static Embedded Implications of Normal Logic Programs (EP, FO, EP, MN), pp. 133–146.
PADL-2005-NieuwenborghHV #order: An Ordered Logic Program Solver (DVN, SH, DV), pp. 128–142.
PADL-2005-SaadP #framework #hybrid #probability #towards: Towards a More Practical Hybrid Probabilistic Logic Programming Framework (ES, EP), pp. 67–82.
PPDP-2005-LopezPPW #concurrent #linear #monad: Monadic concurrent linear logic programming (PL, FP, JP, KW), pp. 35–46.
PPDP-2005-SahaR #analysis #incremental #points-to #using: Incremental and demand-driven points-to analysis using logic programming (DS, CRR), pp. 117–128.
SAS-2005-BruynoogheGH #analysis #source code #termination: Inference of Well-Typings for Logic Programs with Application to Termination Analysis (MB, JPG, WVH), pp. 35–51.
SAC-2005-GuoJ #source code: Mode-directed preferences for logic programs (HFG, BJ), pp. 1414–1418.
SAC-2005-Tarau: Agent oriented logic programming in Jinni 2004 (PT), pp. 1427–1428.
WRLA-2004-Lopez-FraguasRV05 #constraints #functional #revisited: Constraint Functional Logic Programming Revisited (FJLF, MRA, RdVV), pp. 5–50.
ESOP-2005-LuK #source code: Determinacy Inference for Logic Programs (LL, AK), pp. 108–123.
CADE-2005-Pientka #higher-order: Tabling for Higher-Order Logic Programming (BP), pp. 54–68.
ICLP-2005-BrasselH #analysis #functional #nondeterminism #source code: Nondeterminism Analysis of Functional Logic Programs (BB, MH), pp. 265–279.
ICLP-2005-ChristiansenD #abduction #named #programming language #prolog: HYPROLOG: A New Logic Programming Language with Assumptions and Abduction (HC, VD), pp. 159–173.
ICLP-2005-DuanYK #semantics #source code: Semantics of Framed Temporal Logic Programs (ZD, XY, MK), pp. 356–370.
ICLP-2005-NguyenS #analysis #polynomial #source code #termination: Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs (MTN, DDS), pp. 311–325.
ICLP-2005-PueblaAH #analysis #framework #source code: A Generic Framework for the Analysis and Specialization of Logic Programs (GP, EA, MVH), pp. 407–409.
ICLP-2005-RochaSC #evaluation #source code: Dynamic Mixed-Strategy Evaluation of Tabled Logic Programs (RR, FMAS, VSC), pp. 250–264.
ICLP-2005-SaadP #hybrid #probability #source code: Hybrid Probabilistic Logic Programs with Non-monotonic Negation (ES, EP), pp. 204–220.
ICLP-2005-Schindlauer #semantics #source code #web: Nonmonotonic Logic Programs for the Semantic Web (RS), pp. 446–447.
ICLP-2005-Wilson #using: Use of Logic Programming for Complex Business Rules (WGW), pp. 14–20.
RTA-2004-LimetS #proving #source code #term rewriting: Proving Properties of Term Rewrite Systems via Logic Programs (SL, GS), pp. 170–184.
FLOPS-2004-PemmasaniGDRR #online #source code: Online Justification for Tabled Logic Programs (GP, HFG, YD, CRR, IVR), pp. 24–38.
CIKM-2004-ChenZ #formal method #mobile #multi: An extended logic programming based multi-agent system formalization in mobile environments (JC, YZ), pp. 166–167.
KR-2004-Bochman: A Causal Logic of Logic Programming (AB), pp. 427–437.
KR-2004-Denecker #analysis #what: What’s in a Model? Epistemological Analysis of Logic Programming (MD), pp. 106–113.
KR-2004-EiterFTW #on the: On Eliminating Disjunctions in Stable Logic Programming (TE, MF, HT, SW), pp. 447–458.
KR-2004-RaedtR #induction: Condensed Representations for Inductive Logic Programming (LDR, JR), pp. 438–446.
LOPSTR-2004-BrasselHHSV #functional #profiling #runtime #source code: Run-Time Profiling of Functional Logic Programs (BB, MH, FH, JS, GV), pp. 182–197.
LOPSTR-2004-Lopez-GarciaBH #analysis #source code #using: Determinacy Analysis for Logic Programs Using Mode and Type Information (PLG, FB, MVH), pp. 19–35.
LOPSTR-2004-Rao #source code: Input-Termination of Logic Programs (MRKKR), pp. 215–230.
LOPSTR-2004-Vanhoof #semantics #source code: Searching Semantically Equivalent Code Fragments in Logic Programs (WV), pp. 1–18.
PDCL-2004-BossiCER #declarative #semantics #source code: Declarative Semantics of Input Consuming Logic Programs (AB, NC, SE, SR), pp. 90–114.
PDCL-2004-Brogi #composition #on the #semantics: On the Semantics of Logic Program Composition (AB), pp. 115–151.
PDCL-2004-ColvinGHHNS #refinement #source code #specification #using: Developing Logic Programs from Specifications Using Stepwise Refinement (RC, LG, IJH, DH, RN, PAS), pp. 66–89.
PDCL-2004-FioravantiPP #constraints #source code: Transformation Rules for Locally Stratified Constraint Logic Programs (FF, AP, MP), pp. 291–339.
PDCL-2004-HoweKL #reasoning #source code: Analysing Logic Programs by Reasoning Backwards (JMH, AK, LL), pp. 152–188.
PDCL-2004-LindenstraussSS #approach #proving #source code #termination: Proving Termination for Logic Programs by the Query-Mapping Pairs Approach (NL, YS, AS), pp. 453–498.
PDCL-2004-PedreschiRS #termination: Characterisations of Termination in Logic Programming (DP, SR, JGS), pp. 376–431.
PEPM-2004-BarkerLV #data access #flexibility #performance: Efficient and flexible access control via logic program specialisation (SB, ML, MV), pp. 190–199.
PEPM-2004-PettorossiP #formal method #program transformation: A theory of totally correct logic program transformations (AP, MP), pp. 159–168.
PPDP-2004-ClevaLL #approach #functional #source code #verification: A logic programming approach to the verification of functional-logic programs (JMC, JL, FJLF), pp. 9–19.
PPDP-2004-GrecoGSS #datalog #multi #programming language #reasoning: Event choice datalog: a logic programming language for reasoning in multiple dimensions (GG, AG, DS, FS), pp. 238–249.
SAS-2004-PayetM #constraints #source code: Non-termination Inference for Constraint Logic Programs (ÉP, FM), pp. 377–392.
SAC-2004-RamirezS #concurrent #constraints #distributed #source code #using: Concurrent and distributed programming using constraint logic programs (RR, AES), pp. 508–509.
ICLP-2004-Barker #source code: Labeled Logic Programs (SB), pp. 448–449.
ICLP-2004-BryPS #evolution #programming language #query #web: Xcerpt and XChange — Logic Programming Languages for Querying and Evolution on the Web (FB, PLP, SS), pp. 450–451.
ICLP-2004-CheneyU #named #programming language #prolog: αProlog: A Logic Programming Language with Names, Binding and α-Equivalence (JC, CU), pp. 269–283.
ICLP-2004-DekhtyarD #probability #semantics #source code: Possible Worlds Semantics for Probabilistic Logic Programs (AD, MID), pp. 137–148.
ICLP-2004-LinkeTW #on the #source code: On Acyclic and Head-Cycle Free Nested Logic Programs (TL, HT, SW), pp. 225–239.
ICLP-2004-Nguyen #named #prolog: MProlog: An Extension of Prolog for Modal Logic Programming (LAN), pp. 469–470.
ICLP-2004-Pearce #semantics #set #source code: Simplifying Logic Programs Under Answer Set Semantics (DP), pp. 210–224.
ICLP-2004-Robertson #coordination #distributed #multi: Multi-agent Coordination as Distributed Logic Programming (DR), pp. 416–430.
ICLP-2004-RochaSC #source code: Speculative Computations in Or-Parallel Tabled Logic Programs (RR, FMAS, VSC), pp. 254–268.
ICLP-2004-Smaus #source code #termination #using: Termination of Logic Programs Using Various Dynamic Selection Rules (JGS), pp. 43–57.
ICLP-2004-Tarau: Agent Oriented Logic Programming Constructs in Jinni 2004 (PT), pp. 477–478.
ICLP-2004-VennekensVB #source code: Logic Programs with Annotated Disjunctions (JV, SV, MB), pp. 431–445.
ICML-2003-BerardiCEM #analysis #layout #learning #source code: Learning Logic Programs for Layout Analysis Correction (MB, MC, FE, DM), pp. 27–34.
LOPSTR-2003-Gallagher #analysis #program transformation #source code: A Program Transformation for Backwards Analysis of Logic Programs (JPG), pp. 92–105.
PADL-2003-BarceloB #consistency #database #query #source code: Logic Programs for Querying Inconsistent Databases (PB, LEB), pp. 208–222.
PADL-2003-CoelhoF #type system #xml: Type-Based XML Processing in Logic Programming (JC, MF), pp. 273–285.
PADL-2003-HillS #source code: Logic Programs as Compact Denotations (PMH, FS), pp. 339–356.
PPDP-2003-Blanchet #approach #automation #encryption #protocol #verification: Automatic verification of cryptographic protocols: a logic programming approach (BB), pp. 1–3.
ESOP-2003-AlpuenteBCF #functional #source code: Correction of Functional Logic Programs (MA, DB, FJC, MF), pp. 54–68.
ESOP-2003-CastroW #approximate: Approximate Pruning in Tabled Logic Programming (LFC, DSW), pp. 69–83.
ESOP-2003-GenaimK #analysis #independence #scheduling #source code: Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling (SG, AK), pp. 84–98.
ICLP-2003-BruscoliG #proving #tutorial: A Tutorial on Proof Theoretic Foundations of Logic Programming (PB, AG), pp. 109–127.
ICLP-2003-EiterF #equivalence #semantics #source code: Uniform Equivalence of Logic Programs under the Stable Model Semantics (TE, MF), pp. 224–238.
ICLP-2003-EiterFGL #evaluation #integration #performance #query #source code: Efficient Evaluation of Logic Programs for Querying Data Integration Systems (TE, MF, GG, DL), pp. 163–177.
ICLP-2003-KingL #source code #verification: Forward versus Backward Verification of Logic Programs (AK, LL), pp. 315–330.
ICLP-2003-Lau #component #development: Component-Based Software Development and Logic Programming (KKL), pp. 103–108.
ICLP-2003-LeeL #source code: Loop Formulas for Disjunctive Logic Programs (JL, VL), pp. 451–465.
ICLP-2003-LoyerS #nondeterminism #source code: Default Knowledge in Logic Programs with Uncertainty (YL, US), pp. 466–480.
ICLP-2003-Morozov #development #logic #web: Development and Application of Logical Actors Mathematical Apparatus for Logic Programming of Web Agents (AAM), pp. 494–495.
ICLP-2003-PemmasaniGDRR #online #source code: Online Justification for Tabled Logic Programs (GP, HFG, YD, CRR, IVR), pp. 500–501.
ICLP-2003-Ridoux #information management: Logic Information Systems for Logic Programmers (OR), pp. 3–19.
ICLP-2003-SahaR #evaluation #incremental #source code: Incremental Evaluation of Tabled Logic Programs (DS, CRR), pp. 392–406.
ICLP-2003-Serebrenik #analysis #source code #termination: Termination Analysis of Logic Programs: Extended Abstract (AS), pp. 507–508.
ICLP-2003-SerebrenikD #refactoring #source code: Refactoring Logic Programs: Extended Abstract (AS, BD), pp. 509–510.
ICLP-2003-Smaus03a #source code #termination: Termination of Logic Programs for Various Dynamic Selection Rules (JGS), pp. 511–512.
ICLP-2003-Winsborough #distributed: A Logic Programming View of Authorization in Distributed Systems (WHW), pp. 20–46.
ICLP-2003-WuPR #complexity #on the: On the Complexity of Dependent And-Parallelism in Logic Programming (YW, EP, DR), pp. 361–376.
FLOPS-2002-Lopez-FraguasS #functional: Narrowing Failure in Functional Logic Programming (FJLF, JSH), pp. 212–227.
FLOPS-2002-LoyerS #nondeterminism #semantics #source code: The Well-Founded Semantics in Normal Logic Programs with Uncertainty (YL, US), pp. 152–166.
FLOPS-2002-Porto #abstraction: Structural Abstraction and Application in Logic Programming (AP), pp. 275–289.
ICML-2002-AlphonseM #induction #set: Feature Subset Selection and Inductive Logic Programming (ÉA, SM), pp. 11–18.
KR-2002-Lin #equivalence #source code: Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic (FL), pp. 170–176.
LOPSTR-2002-AbdennadherR #constraints #synthesis #theorem proving #using: Constraint Solver Synthesis Using Tabled Resolution for Constraint Logic Programming (SA, CR), pp. 32–47.
LOPSTR-2002-ClaytonCPU #bottom-up: Tabling Structures for Bottom-Up Logic Programming (RC, JGC, BP, MU), pp. 50–51.
LOPSTR-2002-ColvinHHS #higher-order #refinement #source code: Refinement of Higher-Order Logic Programs (RC, IJH, DH, PAS), pp. 126–143.
LOPSTR-2002-FioravantiPP #higher-order #logic #monad #program transformation #source code: Combining Logic Programs and Monadic Second Order Logics by Program Transformation (FF, AP, MP), pp. 160–181.
LOPSTR-2002-VanhoofTB #fixpoint #semantics #source code: A Fixed Point Semantics for Logic Programs Extended with Cuts (WV, RT, MB), pp. 238–257.
PADL-2002-GallagherP #abstract interpretation #analysis #automaton #finite #nondeterminism #source code: Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs (JPG, GP), pp. 243–261.
PADL-2002-GuptaGKPIRMDENZ #question #semantics: Semantics-Based Filtering: Logic Programming’s Killer App? (GG, HFG, AIK, EP, JRI, DR, BM, ND, OEK, MN, XZ), pp. 82–100.
PADL-2002-Liang #compilation #higher-order: Compiler Construction in Higher Order Logic Programming (CL), pp. 47–63.
PADL-2002-YangG #data type #performance #source code: Exploiting Efficient Control and Data Structures in Logic Programs (RY, SG), pp. 318–331.
PEPM-2002-Lu #analysis #source code: Path dependent analysis of logic programs (LL), pp. 63–74.
POPL-2002-AbadiB #protocol #security #source code: Analyzing security protocols with secrecy types and logic programs (MA, BB), pp. 33–44.
PPDP-2002-DrapeMS #dot-net #using: Transforming the .NET intermediate language using path logic programming (SD, OdM, GS), pp. 133–144.
PPDP-2002-LagoonS #analysis #precise #source code: Precise pair-sharing analysis of logic programs (VL, PJS), pp. 99–108.
SAS-2002-BruynoogheCGV #analysis #reuse #source code #termination #using: Reuse of Results in Termination Analysis of Typed Logic Programs (MB, MC, SG, WV), pp. 477–492.
SAS-2002-MesnardPN #detection #source code #termination: Detecting Optimal Termination Conditions of Logic Programs (FM, ÉP, UN), pp. 509–526.
SAS-2002-SerebrenikS #float #on the #source code #termination: On Termination of Logic Programs with Floating Point Computations (AS, DDS), pp. 151–164.
SAS-2002-VaucheretB #performance #precise #source code #type inference: More Precise Yet Efficient Type Inference for Logic Programs (CV, FB), pp. 102–116.
CSL-2002-HodasLPSP #proving #resource management: A Tag-Frame System of Resource Management for Proof Search in Linear-Logic Programming (JSH, PL, JP, LS, EP), pp. 167–182.
ICLP-2002-AntoniouM #source code: Embedding Defeasible Logic into Logic Programs (GA, MJM), pp. 393–404.
ICLP-2002-Barker #data access #database #deduction: Access Control for Deductive Databases by Logic Programming (SB), pp. 54–69.
ICLP-2002-Christensen #detection #pervasive #process #using: Using Logic Programming to Detect Activities in Pervasive Healthcare (HBC), pp. 421–436.
ICLP-2002-FerrandL #approximate #finite #reduction: A Logic Program Characterization of Domain Reduction Approximations in Finite Domain CSPs (GF, AL), pp. 478–479.
ICLP-2002-HayashiCO #execution: Integrating Planning, Action Execution, Knowledge Updates and Plan Modifications via Logic Programming (HH, KC, AO), p. 477.
ICLP-2002-LauB #re-engineering: Logic Programming for Software Engineering: A Second Chance (KKL, MVB), pp. 437–451.
ICLP-2002-MaSX #source code: The Limits of Horn Logic Programs (SM, YS, KX), p. 467.
ICLP-2002-MedinaCO #approach #multi: Multi-adjoint Logic Programming: A Neural Net Approach (JM, EMC, MOA), p. 468.
ICLP-2002-OlmerS #prolog #source code: Schema-Based Transformations of Logic Programs in λ-Prolog (PO, PS), p. 472.
ICLP-2002-PearceSSTW #polynomial #source code: A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report (DP, VS, TS, HT, SW), pp. 405–420.
ICLP-2002-PemmasaniRR #constraints #model checking #performance #realtime #using: Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints (GP, CRR, IVR), pp. 100–114.
ICLP-2002-Pientka #higher-order: A Proof-Theoretic Foundation for Tabled Higher-Order Logic Programming (BP), pp. 271–286.
ICDAR-2001-Amin #induction #recognition: Recognition of Hand-Printed Characters Based on Structural Description and Inductive Logic Programming (AA), pp. 333–337.
ICSM-2001-ZhaoCU #concurrent #dependence #source code: A Program Dependence Model for Concurrent Logic Programs and its Applications (JZ, JC, KU), pp. 672–681.
FLOPS-2001-Almendros-JimenezB #bottom-up #evaluation #framework #functional #source code: A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs (JMAJ, ABT), pp. 153–169.
FLOPS-2001-BozzanoDM #bottom-up #effectiveness #first-order #linear #semantics #source code: An Effective Bottom-Up Semantics for First-Order Linear Logic Programs (MB, GD, MM), pp. 138–152.
FLOPS-2001-CaballeroLR #debugging #declarative #functional #lazy evaluation #source code: Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs (RC, FJLF, MRA), pp. 170–184.
FLOPS-2001-DeransartS #source code: Well-Typed Logic Programs Are not Wrong (PD, JGS), pp. 280–295.
FLOPS-2001-Ferri-RamirezHR #functional #incremental #learning #source code: Incremental Learning of Functional Logic Programs (CF, JHO, MJRQ), pp. 233–247.
FLOPS-2001-LagoonS #analysis #framework #source code: A Framework for Analysis of Typed Logic Programs (VL, PJS), pp. 296–310.
FLOPS-2001-LeachN #constraints #higher-order #programming language: A Higher-Order Logic Programming Language with Constraints (JL, SN), pp. 108–122.
FLOPS-2001-Sato #learning #source code: Parameterized Logic Programs where Computing Meets Learning (TS), pp. 40–60.
ICEIS-v1-2001-LeeK #approach: A Logic Programming Approach to Negotiation for Conflict Resolution in BDI Agents System (MJL, JSK), pp. 514–517.
SEKE-2001-FillottraniEK #modelling #object-oriented #uml: Applying Logic Programming Techniques to Object-Oriented Modeling in UML (PRF, EE, SK), pp. 228–235.
TOOLS-USA-2001-Liu #named #object-oriented #programming language: Pluto: An Object-Oriented Logic Programming Language (ML), pp. 153–163.
LOPSTR-2001-AlferesBLP #behaviour: Computing Environment-Aware Agent Behaviours with Logic Program Updates (JJA, AB, JAL, LMP), pp. 216–232.
LOPSTR-2001-DelzannoE #debugging #protocol #proving #security: Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols (GD, SE), pp. 76–90.
PADL-2001-GuptaT #generative #web: Logic Programming Techniques for Dynamic VRML Web Content Generation (AG, PT), pp. 93–107.
PADL-2001-IglesiasGPRM #approach #tool support: Interoperability between Bioinformatics Tools: A Logic Programming Approach (JRI, GG, EP, DR, BM), pp. 153–168.
PADL-2001-RaffaetaF #constraints: Spatio-temporal Annotated Constraint Logic Programming (AR, TWF), pp. 259–273.
PADL-2001-Ramakrishnan #calculus #model checking #using #μ-calculus: A Model Checker for Value-Passing μ-Calculus Using Logic Programming (CRR), pp. 1–13.
PPDP-2001-BossiCR #source code #termination: Termination of Well-Typed Logic Programs (AB, NC, SR), pp. 73–81.
PPDP-2001-HernandezR #algorithm #development #reuse #string: Development Reuse and the Logic Program Derivation of Two String-Matching Algorithms (MH, DAR), pp. 38–48.
PPDP-2001-RychlikowskiT #polymorphism: Polymorphic Directional Types for Logic Programming (PR, TT), pp. 61–72.
SAS-2001-Lu #analysis #source code: Parameterizing a Groundness Analysis of Logic Programs (LL), pp. 146–164.
SAS-2001-MesnardN #source code #static analysis #termination: Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs (FM, UN), pp. 93–110.
ESOP-2001-BossiERS #scheduling #semantics #source code #termination: Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling (AB, SE, SR, JGS), pp. 402–416.
CSL-2001-Bezem #higher-order #source code: An Improved Extensionality Criterion for Higher-Order Logic Programs (MB), pp. 203–216.
ICLP-2001-BanbaraKHT #linear: Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic (MB, KSK, TH, NT), pp. 315–330.
ICLP-2001-BasuMRRV #bisimulation #constraints #using: Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming (SB, MM, CRR, IVR, RMV), pp. 166–180.
ICLP-2001-DeneckerPB #semantics #source code: Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates (MD, NP, MB), pp. 212–226.
ICLP-2001-GrecoGZ #approach #consistency #database #integration #query: A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases (GG, SG, EZ), pp. 348–364.
ICLP-2001-GuoG #implementation #order: A Simple Scheme for Implementing Tabled Logic Programming Systems Based on Dynamic Reordering of Alternatives (HFG, GG), pp. 181–196.
ICLP-2001-LoncT #complexity #parametricity #semantics #source code: Fixed-Parameter Complexity of Semantics for Logic Programs (ZL, MT), pp. 197–211.
ICLP-2001-OrejasPP #embedded #semantics #source code: Semantics of Normal Logic Programs with Embedded Implications (FO, EP, EP), pp. 255–268.
ICLP-2001-Subrahmanian #database #probability: Probabilistic Databases and Logic Programming (VSS), p. 10.
IJCAR-2001-AngerKL #reasoning #semantics #set #source code: NoMoRe : A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics (CA, KK, TL), pp. 325–330.
IJCAR-2001-ArmelinP: Bunched Logic Programming (PAA, DJP), pp. 289–304.
IJCAR-2001-GanzingerM #bottom-up #source code #theorem: A New Meta-complexity Theorem for Bottom-Up Logic Programs (HG, DAM), pp. 514–528.
IJCAR-2001-Pientka #higher-order #reduction #source code #termination: Termination and Reduction Checking for Higher-Order Logic Programs (BP), pp. 401–415.
IFM-2000-Bowen #animation #hardware #semantics #specification: Combining Operational Semantics, Logic Programming and Literate Programming in the Specification and Animation of the Verilog Hardware Description Language (JPB), pp. 277–296.
RTA-2000-OhlebuschCM #analysis #named #source code #termination: TALP: A Tool for the Termination Analysis of Logic Programs (EO, CC, CM), pp. 270–273.
KR-2000-ChomickiLN #approach #policy: A Logic Programming Approach to Conflict Resolution in Policy Management (JC, JL, SAN), pp. 121–132.
LOPSTR-2000-AvelloneFF #framework #source code #synthesis #verification: A formal framework for synthesis and verification of logic programs (AA, MF, CF).
LOPSTR-2000-ColvinHS #composition #refinement: Modular Logic Program Refinement (RC, IJH, PAS).
LOPSTR-2000-EtalleM #functional #lazy evaluation: The lazy functional side of logic programming (SE, JM).
LOPSTR-2000-FioravantiPP #automation #constraints #source code: Automated strategies for specializing constraint logic programs (FF, AP, MP).
LOPSTR-2000-SerebrenikS #analysis #source code #termination: Non-tranformational termination analysis of logic programs, based on general term-orderings (AS, DDS).
LOPSTR-2000-SeresS #higher-order #source code: Higher-order transformation of logic programs (SS, JMS).
LOPSTR-J-2000-AvelloneFF #framework #source code #synthesis #verification: A Formal Framework for Synthesis and Verification of Logic Programs (AA, MF, CF), pp. 1–17.
LOPSTR-J-2000-ColvinHS #composition #refinement: A Technique for Modular Logic Program Refinement (RC, IJH, PAS), pp. 38–56.
LOPSTR-J-2000-FioravantiPP #automation #constraints #source code: Automated Strategies for Specializing Constraint Logic Programs (FF, AP, MP), pp. 125–146.
LOPSTR-J-2000-SerebrenikS #analysis #source code #termination: Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings (AS, DDS), pp. 69–85.
LOPSTR-J-2000-SeresS #higher-order #source code: Higher-Order Transformation of Logic Programs (SS, JMS), pp. 57–68.
PADL-2000-Hanus #approach #functional #user interface #visual notation: A Functional Logic Programming Approach to Graphical User Interfaces (MH), pp. 47–62.
PADL-2000-MarinoM #functional #source code #static analysis #using: Using Static Analysis to Compile Non-sequential Functional Logic Programs (JM, JJMN), pp. 63–80.
PADL-2000-Ramakrishnan #roadmap: Current Trends in Logic Programming: Prospects and Promises (IVR), p. 324.
PADL-2000-Yeh #approach #database #documentation #xml: A Logic Programming Approach to Supporting the Entries of XML Documents in an Object Database (CLY), pp. 278–292.
PPDP-2000-BozzanoDM #bottom-up #linear #semantics #source code: A bottom-up semantics for linear logic programs (MB, GD, MM), pp. 92–102.
PPDP-2000-HanusS #functional #nondeterminism #source code #type system: Type-based nondeterminism checking in functional logic programs (MH, FS), pp. 202–213.
PPDP-2000-Lu #analysis #precise #source code: A precise type analysis of logic programs (LL), pp. 214–225.
PPDP-2000-PelovB #constraints: Extending constraint logic programming with open functions (NP, MB), pp. 235–244.
PPDP-2000-Polakow #linear #order: Linear logic programming with an ordered context (JP), pp. 68–79.
PPDP-2000-TodoranP #continuation #parallel: Continuations for parallel logic programming (ET, NP), pp. 257–267.
ESOP-2000-Charatonik #source code #type checking: Directional Type Checking for Logic Programs: Beyond Discriminative Types (WC), pp. 72–87.
TACAS-2000-RoychoudhuryKRRS #program transformation #using #verification: Verification of Parameterized Systems Using Logic Program Transformations (AR, KNK, CRR, IVR, SAS), pp. 172–187.
CL-2000-AlferesHP #modelling #source code: Partial Models of Extended Generalized Logic Programs (JJA, HH, LMP), pp. 149–163.
CL-2000-Barker: Data Protection by Logic Programming (SB), pp. 1300–1314.
CL-2000-BossiER #semantics #source code: Semantics of Input-Consuming Logic Programs (AB, SE, SR), pp. 194–208.
CL-2000-CuiW #constraints: A System for Tabled Constraint Logic Programming (BC, DSW), pp. 478–492.
CL-2000-DutraCB #parallel #protocol: The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems (IdCD, VSC, RB), pp. 1285–1299.
CL-2000-Gervas #analysis: A Logic Programming Application for the Analysis of Spanish Verse (PG), pp. 1330–1344.
CL-2000-HruzaS #source code: Binary Speed Up for Logic Programs (JH, PS), pp. 116–130.
CL-2000-Janhunen #source code #strict: Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs (TJ), pp. 852–866.
CL-2000-KameyaS #learning #performance #source code: Efficient EM Learning with Tabulation for Parameterized Logic Programs (YK, TS), pp. 269–284.
CL-2000-LaceyRS #higher-order #synthesis: Logic Program Synthesis in a Higher-Order Setting (DL, JR, AS), pp. 87–100.
CL-2000-LauO #semantics #source code: Isoinitial Semantics for Logic Programs (KKL, MO), pp. 223–238.
CL-2000-Liang #generative #parsing #programming language: A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language (CL), pp. 1315–1329.
CL-2000-Lopez-FraguasH #functional #proving #source code: Proving Failure in Functional Logic Programs (FJLF, JSH), pp. 179–193.
CL-2000-NilssonL #constraints #model checking: Constraint Logic Programming for Local and Symbolic Model-Checking (UN, JL), pp. 384–398.
CL-2000-Pallotta #composition #logic #semantics #source code: A Meta-logical Semantics for Features and Fluents Based on Compositional Operators over Normal Logic Programs (VP), pp. 777–791.
CL-2000-WangZL #fixpoint #source code: Alternating Fixpoint Theory for Logic Programs with Priority (KW, LZ, FL), pp. 164–178.
CSL-2000-Jaume #induction: Logic Programming and Co-inductive Definitions (MJ), pp. 343–355.
FLOPS-1999-AlpuenteFMV #functional #lazy evaluation #source code: A Transformation System for Lazy Functional Logic Programs (MA, MF, GM, GV), pp. 147–162.
FLOPS-1999-Gonzalez-MorenoHR #functional #semantics: Semantics and Types in Functional Logic Programming (JCGM, MTHG, MRA), pp. 1–20.
FLOPS-1999-JohnsonRRR #evaluation #performance #source code: A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs (EJ, CRR, IVR, PR), pp. 284–300.
FLOPS-1999-VerbaetenS #analysis #source code #termination #using: Termination Analysis of Tabled Logic Programs Using Mode and Type Information (SV, DDS), pp. 163–178.
ICFP-1999-AlpuenteHLV #functional #source code: Specialization of Inductively Sequential Functional Logic Programs (MA, MH, SL, GV), pp. 273–283.
ICEIS-1999-CarvalhoPJ #java #prolog #virtual machine: NETPROLOG-A Logic Programming System for the Java Virtual Machine (CLdC, ECP, RMdSJ), pp. 591–598.
ICEIS-1999-CarvalhoPJ99a #type inference: Type Inference in Logic Programming Context (CLdC, ECP, RMdSJ), p. 764.
ICML-1999-PalhangS #induction #learning: Learning Discriminatory and Descriptive Rules by an Inductive Logic Programming System (MP, AS), pp. 288–297.
GCSE-1999-DHondtMW #using: Using Reflective Logic Programming to Describe Domain Knowledge as an Aspect (MD, WDM, RW), pp. 16–23.
LOPSTR-1999-Fribourg #constraints #model checking: Constraint Logic Programming Applied to Model Checking (LF), pp. 30–41.
LOPSTR-1999-PettorossiP #source code: Transformation Rules for Logic Programs with Goals as Arguments (AP, MP), pp. 176–195.
LOPSTR-1999-PueblaBH #constraints #debugging #source code: Combined Static and Dynamic Assertion-Based Debugging of Constraint Logic Programs (GP, FB, MVH), pp. 273–292.
LOPSTR-1999-SmausHK #analysis #source code: Mode Analysis Domains for Typed Logic Programs (JGS, PMH, AK), pp. 82–101.
PADL-1999-BansalB #functional #novel: Applying Logic Programming to Derive Novel Functional Information of Genomes (AKB, PB), pp. 275–289.
PADL-1999-GoltzM #constraints #using: University Timetabling Using Constraint Logic Programming (HJG, DM), pp. 320–334.
PADL-1999-LetelierSR #automation #concurrent #prototype #requirements #specification: Prototyping a Requirements Specification through an Automatically Generated Concurrent Logic Program (PL, PS, IR), pp. 31–45.
PADL-1999-SilvaDBC #architecture #parallel #parametricity #performance: The Influence of Architectural Parameters on the Performance of Parallel Logic Programming Systems (MGS, IdCD, RB, VSC), pp. 122–136.
PADL-1999-Vasconcelos #flexibility #framework #slicing #source code: A Flexible Framework for Dynamic and Static Slicing of Logic Programs (WWV), pp. 259–274.
PPDP-1999-Arenas-SanchezLR #constraints #functional: Functional Plus Logic Programming with Built-In and Symbolic Constraints (PAS, FJLF, MRA), pp. 152–169.
PPDP-1999-Davila #abduction #named #programming language: OPENLOG: A Logic Programming Language Based on Abduction (JAD), pp. 278–293.
PPDP-1999-NeumerkelM #source code: Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices (UN, FM), pp. 328–342.
PPDP-1999-RoychoudhuryKRR #framework #source code: A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs (AR, KNK, CRR, IVR), pp. 396–413.
SAC-1999-ArcelliF #flexibility #named #programming language #retrieval: Likelog: A Logic Programming Language for Flexible Data Retrieval (FAF, FF), pp. 260–267.
ESOP-1999-PodelskiCM #analysis #concurrent #constraints #source code: Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs (AP, WC, MM), pp. 177–192.
FoSSaCS-1999-ArruabarrenaLN #embedded: A Strong Logic Programming View for Static Embedded Implications (RA, PL, MN), pp. 56–72.
TACAS-1999-Heljanko #concurrent #petri net #problem #reachability #semantics #source code #using: Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets (KH), pp. 240–254.
CSL-1999-VosV #game studies #nash #source code: Choice Logic Programs and Nash Equilibria in Strategic Games (MDV, DV), pp. 266–276.
ICLP-1999-Bezem #source code: Extensionality of Simply Typed Logic Programs (MB), pp. 395–410.
ICLP-1999-BuccafurriFL #inheritance #source code: Disjunctive Logic Programs with Inheritance (FB, WF, NL), pp. 79–93.
ICLP-1999-CuiW #multi: Multiple Terms in a Tabled Logic Programming System (BC, DSW), pp. 305–319.
ICLP-1999-DekhtyarDS #probability #source code: Temporal Probabilistic Logic Programs (AD, MID, VSS), pp. 109–123.
ICLP-1999-EtalleR: Logic Programming with Requests (SE, FvR), pp. 558–572.
ICLP-1999-KangT #linear #programming language #static analysis: A Static Analysis for Classical Linear Logic Programming Language (KSK, NT), p. 610.
ICLP-1999-LauO #modelling #source code: Isoinitial Models for Logic Programs: Some Preliminary Results (KKL, MO), p. 611.
ICLP-1999-LuC #analysis #source code: A Regular Type Analysis of Logic Programs (LL, JGC), p. 613.
ICLP-1999-MarinoM #functional #source code #static analysis #using: Using Static Analysis to Compile Non-sequential Functional Logic Programs (JM, JJMN), p. 614.
ICLP-1999-PedreschiR #bound #nondeterminism #source code: Bounded Nondeterminism of Logic Programs (DP, SR), pp. 350–364.
ICLP-1999-Roy: Logic Programming in Oz with Mozart (PVR), pp. 38–51.
ICLP-1999-RoychoudhuryKR #source code: Generalized Unfold/fold Transformation Systems for Normal Logic Programs (AR, KNK, IVR), p. 616.
ICLP-1999-SatoF #learning: Reactive Logic Programming by Reinforcement Learning (TS, SF), p. 617.
ICLP-1999-SeresSH #algebra: Algebra of Logic Programming (SS, JMS, CARH), pp. 184–199.
ICLP-1999-Smaus #proving #source code #termination: Proving Termination of Input-Consuming Logic Programs (JGS), pp. 335–349.
ICLP-1999-Verbaeten #abduction #analysis #source code #termination: Termination Analysis for Abductive General Logic Programs (SV), pp. 365–379.
PODS-1998-VorobyovV #complexity #recursion #source code: Complexity of Nonrecursive Logic Programs with Complex Values (SGV, AV), pp. 244–253.
CSMR-1998-ZhaoCU98a #concurrent #metric #source code: A Metrics Suite for Concurrent Logic Programs (JZ, JC, KU), pp. 172–178.
KR-1998-AlferesLPPP: Dynamic Logic Programming (JJA, JAL, LMP, HP, TCP), pp. 98–111.
KR-1998-BrewkaE #set #source code: Preferred Answer Sets for Extended Logic Programs (GB, TE), pp. 86–97.
ALP-PLILP-1998-BruynoogheVWD #detection #query #source code: Detecting Unsolvable Queries for Definite Logic Programs (MB, HV, DAdW, MD), pp. 118–133.
ALP-PLILP-1998-CosmoLN #game studies #semantics: A Game Semantics Foundation for Logic Programming (RDC, JVL, SN), pp. 355–373.
ALP-PLILP-1998-CuiDDKRRRSW #model checking: Logic Programming and Model Checking (BC, YD, XD, KNK, CRR, IVR, AR, SAS, DSW), pp. 1–20.
ALP-PLILP-1998-LeviS #empirical #refinement #source code: An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs (GL, FS), pp. 152–169.
ALP-PLILP-1998-LiptonM #constraints #encapsulation: Encapsulating Data in Logic Programming via Categorial Constraints (JL, RM), pp. 391–410.
ALP-PLILP-1998-SmausHK #source code #termination: Termination of Logic Programs with block Declarations Running in Several Modes (JGS, PMH, AK), pp. 73–88.
ALP-PLILP-1998-VanhoofSM #bottom-up #framework #source code: A Framework for Bottom Up Specialisation of Logic Programs (WV, DDS, BM), pp. 54–72.
LOPSTR-1998-BossiC #source code: Success in Logic Programs (AB, NC), pp. 219–239.
LOPSTR-1998-BossiR #source code #specification: Specialising Logic Programs with Respect to Call?Post Specifications (AB, SR), pp. 159–178.
LOPSTR-1998-HamfeltN #combinator #composition #induction #source code #synthesis: Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes (AH, JFN), pp. 143–158.
LOPSTR-1998-HoarauM #compilation #constraints #source code #termination: Inferring and Compiling Termination for Constraint Logic Programs (SH, FM), pp. 240–254.
LOPSTR-1998-RobertsonA #source code #synthesis: Pragmatics in the Synthesis of Logic Programs (DSR, JAC), pp. 41–60.
LOPSTR-1998-SmausHK #fault #multi #source code #using: Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations (JGS, PMH, AK), pp. 289–307.
LOPSTR-1998-VanhoofSM #bottom-up #source code: Bottom-Up Specialisation of Logic Programs (WV, DDS, BM), pp. 325–327.
SAS-1998-AlbertAFJV #functional: Improving Control in Functional Logic Program Specialization (EA, MA, MF, PJI, GV), pp. 262–277.
SAS-1998-CharatonikP #source code #type inference: Directional Type Inference for Logic Programs (WC, AP), pp. 278–294.
SAS-1998-FagesG #analysis #source code: Analysis of Normal Logic Programs (FF, RG), pp. 82–98.
SAS-1998-PeraltaGS #analysis #constraints #imperative #source code: Analysis of Imperative Programs through Analysis of Constraint Logic Programs (JCP, JPG, HS), pp. 246–261.
SAS-1998-Volpe #alias #first-order #source code: A First-Order Language for Expressing Aliasing and Type Properties of Logic Programs (PV), pp. 184–199.
ASE-1998-FlenerZH #constraints #source code #synthesis: Schema-Guided Synthesis of Constraint Logic Programs (PF, HZ, BH), pp. 168–176.
TACAS-1998-AikenFS #detection #source code: Detecting Races in Relay Ladder Logic Programs (AA, MF, ZS), pp. 184–200.
CSL-1998-MarekPT #constraints: Revision Programming = Logic Programming + Integrity Constraints (VWM, IP, MT), pp. 73–89.
JICSLP-1998-AngelopoulosPW #algorithm #constraints #implementation #random: Implementing Randomised Algorithms in Constraint Logic Programming (NA, ADP, HW), pp. 355–356.
JICSLP-1998-Cervesato #compilation: Proof-Theoretic Foundation of Compilation in Logic Programming (IC), pp. 115–129.
JICSLP-1998-FonsecaCD #execution #named #parallel #source code #visualisation: VisAll: A Universal Tool to Visualise Parallel Execution of Logic Programs (NAF, VSC, IdCD), pp. 100–114.
JICSLP-1998-HanusS #source code: Controlling Search in Funtional Logic Programs (MH, FS), pp. 347–348.
JICSLP-1998-HodasWTK #implementation #linear #performance #programming language: Efficient Implementation of a Linear Logic Programming Language (JSH, KMW, NT, KSK), pp. 145–159.
JICSLP-1998-KakasM #abduction: Applications of Abductive Logic Programming (ACK, AM), pp. 343–344.
JICSLP-1998-Lavrac #induction #information management #relational: Inductive Logic Programming for Relational Knowledge Discovery (NL), pp. 7–24.
JICSLP-1998-LeiteP: Iterated Logic Program Updates (JAL, LMP), pp. 265–278.
JICSLP-1998-McAloon #linear #research: Disjunctive Linear Programming: At the Intersection of Operations Research and Logic Programming (KM), pp. 5–6.
JICSLP-1998-Refalo98a #constraints: Meta-linear Constraints in Constraint Logic Programming (PR), pp. 55–69.
ICALP-1997-Ruggieri #constraints #source code #termination: Termination of Constraint Logic Programs (SR), pp. 838–848.
ICML-1997-CohenD #case study #comparative #fault #induction #predict: A Comparative Study of Inductive Logic Programming Methods for Software Fault Prediction (WWC, PTD), pp. 66–74.
ALP-1997-CodishT #analysis #constraints #semantics #source code #termination #using: A Semantic Basis for Termination Analysis of Logic Programs and Its Realization Using Symbolic Norm Constraints (MC, CT), pp. 31–45.
LOPSTR-1997-BuyukyildizF #program transformation: Generalised Logic Program Transformation Schemas (HB, PF), pp. 49–68.
LOPSTR-1997-ChasseurD #constraints: Logic Program Schemas, Constraints, and Semi-unification (EC, YD), pp. 69–89.
LOPSTR-1997-DecorteSLMS #analysis #termination: Termination Analysis for Tabled Logic Programming (SD, DDS, ML, BM, KFS), pp. 111–127.
LOPSTR-1997-HeatonHK #analysis #source code: Analysis of Logic Programs with Delay (AH, PMH, AK), pp. 148–167.
LOPSTR-1997-LafaveG #constraints #functional #partial evaluation #source code: Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs (LL, JPG), pp. 168–188.
LOPSTR-1997-LeuschelMS #source code #termination: Preserving Termination of Tabled Logic Programs While Unfolding (ML, BM, KFS), pp. 189–205.
LOPSTR-1997-MomiglianoO #reasoning #source code #towards: Towards a Logic for Reasoning About Logic Programs Transformation (AM, MO), pp. 226–244.
LOPSTR-1997-SaglamG #approximate #source code: Constrained Regular Approximation of Logic Programs (HS, JPG), pp. 282–299.
PEPM-1997-AlpuenteFJV #functional #lazy evaluation #source code: Specialization of Lazy Functional Logic Programs (MA, MF, PJI, GV), pp. 151–162.
PLILP-1997-BowersHI #quantifier: Resolution for Logic Programming with Universal Quantifiers (AFB, PMH, FI), pp. 63–77.
PLILP-1997-Hanus #education #functional: Teaching Functional and Logic Programming with a Single Computational Model (MH), pp. 335–350.
PLILP-1997-HuangSS #parallel #source code: Selective Recomputation for Handling Side-Effects in Parallel Logic Programs (ZH, CS, AS), pp. 275–289.
POPL-1997-Hanus #functional: A Unified Computation Model for Functional and Logic Programming (MH), pp. 80–93.
POPL-1997-PettorossiPR #nondeterminism #source code: Reducing Nondeterminism while Specializing Logic Programs (AP, MP, SR), pp. 414–427.
SAS-1997-CodishLB #algebra #analysis #approach #source code: An Algebraic Approach to Sharing Analysis of Logic Programs (MC, VL, FB), pp. 68–82.
SAS-1997-TalbotTD #analysis #automaton: Set-Based Analysis for Logic Programming and Tree Automata (JMT, ST, PD), pp. 127–140.
SAS-1997-Zartmann #abstract interpretation #functional #source code: Denotational Abstract Interpretation of Functional Logic Programs (FZ), pp. 141–159.
EDTC-1997-BeckmannH #constraints #in memory #memory management #synthesis #using: Using constraint logic programming in memory synthesis for general purpose computers (RB, JH), p. 619.
EDTC-1997-GirodiasC #constraints #correlation #interface #using #verification: Interface timing verification with delay correlation using constraint logic programming (PG, EC), pp. 12–19.
PDP-1997-CostaBD #parallel #protocol: Evaluating the impact of coherence protocols on parallel logic programming systems (VSC, RB, IdCD), pp. 376–381.
TAPSOFT-1997-Arenas-SanchezR #algebra #framework #functional #polymorphism #semantics: A Semantic Framework for Functional Logic Programming with Algebraic Polymorphic Types (PAS, MRA), pp. 453–464.
TAPSOFT-1997-MartinK #generative #performance #source code: Generating Efficient, Terminating Logic Programs (JCM, AK), pp. 273–284.
CAV-1997-LindenstraussSS #named #query #source code #termination: TermiLog: A System for Checking Termination of Queries to Logic Programs (NL, YS, AS), pp. 444–447.
ICLP-1997-BaumgartnerF #calculus: Calculi for Disjunctive Logic Programming (PB, UF), p. 409.
ICLP-1997-BelleghemDS #logic: A Strong Correspondence between Description Logics and Open Logic Programming (KVB, MD, DDS), pp. 346–360.
ICLP-1997-BruynoogheJK #analysis #programming language: Live-Structure Analysis for Logic Programming Languages with Declarations (MB, GJ, AK), pp. 33–47.
ICLP-1997-BuenoCL #analysis #set #source code #using: Sharing Analysis Using Set Logic Programs (FB, MC, VL), p. 417.
ICLP-1997-Codish #bottom-up #evaluation #performance #source code: Efficient Goal Directed Bottom-up Evaluation of Logic Programs (MC), p. 422.
ICLP-1997-DebrayGH #analysis #source code: Non-Failure Analysis for Logic Programs (SKD, PLG, MVH), pp. 48–62.
ICLP-1997-DecorteS #analysis #automation #constraints #source code: Demand-Driven and Constraint-Based Automatic Left-Termination Analysis for Logic Programs (SD, DDS), pp. 78–92.
ICLP-1997-Gonzalez-MorenoHR #functional #higher-order: A Higher Order Rewriting Logic for Functional Logic Programming (JCGM, MTHG, MRA), pp. 153–167.
ICLP-1997-LammaMM #constraints #reasoning: Reasoning on Constraints in Constraint Logic Programming (EL, MM, PM), p. 413.
ICLP-1997-LindenstraussS #analysis #automation #source code #termination: Automatic Termination Analysis of Logic Programs (NL, YS), pp. 63–77.
ICLP-1997-Mahajan #concurrent #π-calculus: Concurrent Logic Programming and π Calculus (SM, SR), p. 411.
ICLP-1997-MolinaP #composition #functional: Modularity in Functional-Logic Programming (JMMB, EP), pp. 183–197.
ICLP-1997-PueblaBMS #optimisation #scheduling #source code: Optimization of Logic Programs with Dynamic Scheduling (GP, MJGdlB, KM, PJS), pp. 93–107.
ICLP-1997-Raamsdonk #source code #term rewriting: Translating Logic Programs into Conditional Rewriting Systems (FvR), pp. 168–182.
ICLP-1997-Schachte: Global Variables in Logic Programming (PS), pp. 3–17.
ICLP-1997-SmausHK #analysis #source code: Domain Construction for Mode Analysis of Typed Logic Programs (JGS, PMH, AK), p. 418.
ICLP-1997-TsuchidaAIY #constraints #using: Tree Drawing Using Constraint Logic Programming (KT, YA, TI, TY), p. 414.
ICLP-1997-VaupelGP #execution #source code #visualisation: Visualization of And/Or-Parallel Execution of Logic Programs (RV, EP, GG), pp. 271–285.
ICLP-1997-YouWY: Disjunctive Logic Programming as Constrained Inferences (JHY, XW, LYY), pp. 361–375.
ILPS-1997-Arenas-SanchezR #algebra #calculus #functional #lazy evaluation #polymorphism: A Lazy Narrowing Calculus for Functional Logic Programming with Algebraic Polymorphic Types (PAS, MRA), pp. 53–67.
ILPS-1997-BaumgartnerF #calculus: Calculi for Disjunctive Logic Programming (PB, UF), pp. 229–243.
ILPS-1997-Dahl #natural language: Logic Programming for Processing Natural Language (VD), pp. 41–42.
ILPS-1997-DebrayLHL #bound #estimation #source code: Lower Bound Cost Estimation for Logic Programs (SKD, PLG, MVH, NWL), pp. 291–305.
ILPS-1997-DovierFP #on the: On T Logic Programming (AD, AF, AP), pp. 323–337.
ILPS-1997-GelfondG #functional #specification: From Functional Specifications to Logic Programms (MG, AG), pp. 355–369.
ILPS-1997-Grosof #source code: Prioritized Conflict Handling for Logic Programs (BNG), pp. 197–211.
ILPS-1997-KingSB #analysis #bound #source code: Lower-bound Time-complexity Analysis of Logic Programs (AK, KS, FB), pp. 261–275.
ILPS-1997-LeachNR #constraints: Constraint Logic Programming with Hereditary Harrop Formulas (JL, SN, MRA), pp. 307–321.
ILPS-1997-Podelski #analysis #source code: Set-Based Analysis of Logic Programs and Reactive Logic Programs (AP), pp. 35–36.
ILPS-1997-TanL #analysis #precise #recursion #source code: Recursive Modes for Precise Analysis of Logic Programs (JT, IPL), pp. 277–290.
ILPS-1997-Tarau #internet #tool support: Logic Programming Tools for Advanced Internet Programming (PT), pp. 33–34.
ILPS-1997-TodoranHV #commit #comparative #metric #semantics: Comparative Metric Semantics for Commit in OR-Parallel Logic Programming (ET, JdH, EPdV), pp. 101–115.
ILPS-1997-VerbaetenDS #composition #source code: Compositionality of Normal Open Logic Programs (SV, MD, DDS), pp. 371–385.
ILPS-1997-ZhangF #set #source code: Answer Sets for Prioritized Logic Programs (YZ, NYF), pp. 69–83.
HT-1996-LokeD #web: Logic Programming with the World-Wide Web (SWL, AD), pp. 235–245.
AKDDM-1996-Dzeroski #database #induction #information management: Inductive Logic Programming and Knowledge Discovery in Databases (SD), pp. 117–152.
ICML-1996-Bostrom #induction #regular expression #source code: Theory-Guideed Induction of Logic Programs by Inference of Regular Languages (HB), pp. 46–53.
KR-1996-BrassDP #source code: Super Logic Programs (SB, JD, TCP), pp. 529–540.
ALP-1996-Almendros-JimenezGG #algebra #functional #order #polymorphism #semantics: Algebraic Semantics for Functional Logic Programming with Polymorphic Order-Sorted Types (JMAJ, AGF, AGL), pp. 299–313.
ALP-1996-FagesG #constraints #semantics #source code: A Hierarchy of Semantics for Normal Constraint Logic Programs (FF, RG), pp. 77–91.
ALP-1996-GiacobazziR #semantics: Complementing Logic Program Semantics (RG, FR), pp. 238–253.
LOPSTR-1996-BrogiC #composition #source code: Specialising Meta-level Compositions of Logic Programs (AB, SC), pp. 275–294.
LOPSTR-1996-FribourgO #petri net #reduction #source code: Reductions of Petri Nets and Unfolding of Propositional Logic Programs (LF, HO), pp. 187–203.
LOPSTR-1996-Gegg-Harrison: Extensible Logic Program Schemata (TSGH), pp. 256–274.
LOPSTR-1996-HayesNS #source code #specification: Refining Specifications to Logic Programs (IJH, RGN, PAS), pp. 1–19.
LOPSTR-1996-LeuschelS #how: Logic Program Specialisation: How to Be More Specific (ML, DDS), p. 58.
LOPSTR-1996-LeuschelS96a #source code: Redundant Argument Filtering of Logic Programs (ML, MHS), pp. 83–103.
LOPSTR-1996-MartinKS #source code: Typed Norms for Typed Logic Programs (JCM, AK, PS), pp. 224–238.
PLDI-1996-DawsonRW #case study #program analysis #using: Practical Program Analysis Using General Purpose Logic Programming Systems — A Case Study (SD, CRR, DSW), pp. 117–126.
PLILP-1996-Fecht #performance #precise #source code: An Efficient and Precise Sharing Domain for Logic Programs (CF), pp. 469–470.
PLILP-1996-FreireSW #scheduling #source code: Beyond Depth-First: Improving Tabled Logic Programs through Alternative Scheduling Strategies (JF, TS, DSW), pp. 243–258.
PLILP-1996-LeuschelS #how: Logic Program Specialisation: How To Be More Specific (ML, DDS), pp. 137–151.
PLILP-1996-PueblaH #automation #optimisation #scheduling #source code: Automatic Optimization of Dynamic Scheduling in Logic Programs (GP, MVH), pp. 475–476.
PLILP-1996-Ruggieri #decidability #semantics #testing: Decidability of Logic Program Semantics and Applications to Testing (SR), pp. 347–362.
PLILP-1996-StuckeyT #constraints #modelling #probability #theorem proving #using: Models for Using Stochastic Constraint Solvers in Constraint Logic Programming (PJS, VT), pp. 423–437.
SAS-1996-BoerGP #constraints #correctness #proving #scheduling #source code: Proving Correctness of Constraint Logic Programs with Dynamic Scheduling (FSdB, MG, CP), pp. 83–97.
SAS-1996-BruynoogheDBDM #analysis #source code: A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation (MB, BD, DB, MD, AM), pp. 128–142.
SAS-1996-KellyMSS #analysis #constraints #incremental #source code: Two Applications of an Incremental Analysis Engine for (Constraint) Logic Programs (ADK, KM, HS, PJS), pp. 385–386.
SAS-1996-PueblaH #algorithm #analysis #incremental #source code: Optimized Algorithms for Incremental Analysis of Logic Programs (GP, MVH), pp. 270–284.
SAC-1996-Gurr #specification: Verifiable partial specifications for logic programming (CAG), pp. 374–379.
SAC-1996-WassermanYS #metric #on the: On quantitative measurement of negation in logic programming (HCW, KY, ZS), pp. 58–62.
ESOP-1996-AlpuenteFV #functional #partial evaluation #source code: Narrowing-Driven Partial Evaluation of Functional Logic Programs (MA, MF, GV), pp. 45–61.
ESOP-1996-RohwedderP #higher-order #source code #termination: Mode and Termination Checking for Higher-Order Logic Programs (ER, FP), pp. 296–310.
CADE-1996-FeliciRT #distributed #named: FasTraC: A Decentralized Traffic Control System Based on Logic Programming (GF, GR, KT), pp. 216–220.
JICSLP-1996-BaldoniGM #framework: A Framework for a Modal Logic Programming (MB, LG, AM), pp. 52–66.
JICSLP-1996-Bry #composition #database #deduction #semantics #source code: A Compositional Semantics for Logic Programs and Deductive Databases (FB), pp. 453–467.
JICSLP-1996-CholewinskiT #problem: Extremal Problems in Logic Programming and Stable Model Computation (PC, MT), pp. 408–422.
JICSLP-1996-ChoU #concurrent #source code: Diagnosing Non-Well-Moded Concurrent Logic Programs (KC, KU), pp. 215–229.
JICSLP-1996-HamfeltN #declarative #recursion: Declarative Logic Programming with Primitive Recursive Relations on Lists (AH, JFN), pp. 230–243.
JICSLP-1996-KusalikP #execution #parallel #performance #visualisation: Visualizing Parallel Logic Program Execution for Performance Tuning (AJK, SDP), pp. 498–512.
JICSLP-1996-Mesnard #constraints #query #source code: Inferring Left-terminating Classes of Queries for Constraint Logic Programs (FM), pp. 7–21.
JICSLP-1996-Pradhan #source code: Logic Programs with Contested Information (SP), pp. 423–437.
JICSLP-1996-SakamaI #representation #source code: Representing Priorities in Logic Programs (CS, KI), pp. 82–96.
JICSLP-1996-TanL #source code #synthesis: Type Synthesis for Logic Programs (JT, IPL), pp. 200–214.
JICSLP-1996-Thielscher #proving #semantics #source code: A Nonmonotonic Disputation-Based Semantics and Proof Procedure for Logic Programs (MT), pp. 483–497.
LICS-1996-Pradhan #semantics #source code: Semantics of Normal Logic Programs and Contested Information (SP), pp. 406–415.
ICALP-1995-GrecoSZ #automaton #source code: The PushDown Method to Optimize Chain Logic Programs (SG, DS, CZ), pp. 523–534.
RTA-1995-AnantharamanR #source code: A Rewrite Mechanism for Logic Programs with Negation (SA, GR), pp. 163–178.
FPCA-1995-Marchiori #functional: The Functional Side of Logic Programming (MM), pp. 55–65.
SEKE-1995-Lee #execution #parallel #source code: Parallel Execution of Logic Programs with Breadth-first Search (WSL), pp. 470–477.
LOPSTR-1995-ArtsZ #semantics #source code #termination #unification #using: Termination of Logic Programs Using Semantic Unification (TA, HZ), pp. 219–233.
LOPSTR-1995-FlenerD #program transformation: Logic Program Transformation through Generalization Schemata (PF, YD), pp. 171–173.
LOPSTR-1995-Hanus #functional #lazy evaluation #performance #prolog #source code: Efficient Translation of Lazy Functional Logic Programs into Prolog (MH), pp. 252–266.
LOPSTR-1995-LauO #deduction #object-oriented #source code #synthesis #towards: Towards an Object-Oriented Methodology for Deductive Synthesis of Logic Programs (KKL, MO), pp. 152–169.
LOPSTR-1995-ParkesW #horn clause #induction #synthesis: Logic Program Synthesis by Induction over Horn Clauses (AJP, GAW), p. 170.
LOPSTR-1995-Renault #proving #source code #towards: Towards a Complete Proof Procedure to Prove Properties of Normal Logic Programs under the Completion (SR), pp. 204–218.
LOPSTR-1995-ToniK #approach #program transformation: An Argumentation-Theoretic Approach to Logic Program Transformation (FT, RAK), pp. 61–75.
LOPSTR-1995-VasconcelosF #approach #optimisation #program analysis #using: An Opportunistic Approach for Logic Program Analysis and Optimisation Using Enhanced Schema-Based Transformations (WWV, NEF), pp. 174–188.
PEPM-1995-Lu #analysis #source code: Type Analysis of Logic Programs in the Presence of Type Definitions (LL), pp. 241–252.
PEPM-1995-PueblaH #implementation #multi #source code: Implementation of Multiple Specialization in Logic Programs (GP, MVH), pp. 77–87.
PEPM-1995-RamakrishnanRS #analysis #constraints #framework #source code #theorem proving: A Symbolic Constraint Solving Framework for Analysis of Logic Programs (CRR, IVR, RCS), pp. 12–23.
PLILP-1995-ColussiMM #constraints #data flow #semantics #source code: A Dataflow Semantics for Constraint Logic Programs (LC, EM, MM), pp. 431–448.
PLILP-1995-DawsonRR #design #implementation #performance #source code: Design and Implementation of Jump Tables for Fast Indexing of Logic Programs (SD, CRR, IVR), pp. 133–150.
PLILP-1995-NakaharaMI #calculus #functional #higher-order: A Complete Narrowing Calculus for Higher-Order Functional Logic Programming (KN, AM, TI), pp. 97–114.
PLILP-1995-SaglamG #approximate #constraints #polymorphism #source code #using: Approximating Constraint Logic Programs Using Polymorphic Types and Regular Descriptions (HS, JPG), pp. 461–462.
POPL-1995-DawsonRRSSSW #execution #performance #source code #unification: Unification Factoring for Efficient Execution of Logic Programs (SD, CRR, IVR, KFS, SS, TS, DSW), pp. 247–258.
SAC-1995-Bsaies #proving: Discovering and proving logic program properties (KB), pp. 369–373.
SAC-1995-Fisher #specification: Logic program based action specifications (JRF), pp. 248–252.
SAC-1995-WassermanYS #source code: An alternative transformation rule for logic programs (HCW, KY, ZS), pp. 364–368.
DAC-1995-BiekerM #constraints #generative #self #using: Retargetable Self-Test Program Generation Using Constraint Logic Programming (UB, PM), pp. 605–611.
PDP-1995-TubellaG #parallel: Exploiting path parallelism in logic programming (JT, AG), pp. 164–173.
ESOP-J-1994-Andrews95 #constraints #implementation: Foundational Issues in Implementing Constraint Logic Programming Systems (JHA), pp. 117–147.
TAPSOFT-1995-KaraliH #composition #refinement #semantics: A Refinement of Import/Export Declarations in Modular Logic Programming and its Semantics (IK, CH), pp. 486–500.
ICLP-1995-Beierle #order #polymorphism #source code: Type Inferencing for Polymorphic Order-Sorted Logic Programs (CB), pp. 765–779.
ICLP-1995-BurgSTY #constraints #equation #linear: Linear Equation Solving for Constraint Logic Programming (JB, PJS, JCHT, RHCY), pp. 33–47.
ICLP-1995-CervesatoCM #calculus #framework #order: A Modal Calculus of Partially Ordered Events in a Logic Programming Framework (IC, LC, AM), pp. 299–313.
ICLP-1995-ChengPE #equation #implementation #source code: A Method for Implementing Equational Theories as Logic Programs (MHMC, DSPJ, MHvE), pp. 497–511.
ICLP-1995-FagesFS #constraints: A Reactive Constraint Logic Programming Scheme (FF, JF, TS), pp. 149–163.
ICLP-1995-Gegg-Harrison #prolog #representation: Representing Logic Program Schemata in λ-Prolog (TSGH), pp. 467–481.
ICLP-1995-GovindarajanJM: Preference Logic Programming (KG, BJ, SM), pp. 731–745.
ICLP-1995-GuptaCP #array #parallel: Shared Paged Binding Array: A Universal Datastructure for Parallel Logic Programming (GG, VSC, EP), p. 824.
ICLP-1995-Hanus #equation #on the: On Extra Variables in (Equational) Logic Programming (MH), pp. 665–679.
ICLP-1995-HermenegildoGC #concurrent #implementation #parallel #using: Using Attributed Variables in the Implementation of Concurrent and Parallel Logic Programming Systems (MVH, DCG, MC), pp. 631–645.
ICLP-1995-HermenegildoPMS #analysis #incremental #source code: Incremental Analysis of Logic Programs (MVH, GP, KM, PJS), pp. 797–811.
ICLP-1995-IsozakiK #estimation #execution #source code #transaction: Transformation of Transaction Logic Programs based on Estimation of Transaction Execution Paths (HI, HK), p. 822.
ICLP-1995-Jain #source code #using: Projections of Logic Programs using Symbol Mappings (AJ), pp. 483–496.
ICLP-1995-KakasM #abduction #constraints: Integrating Abductive and Constraint Logic Programming (ACK, AM), pp. 399–413.
ICLP-1995-Moreno-Navarro #constraints #inheritance #tuple: Tuple Inheritance: A New Kind of Inheritance for (Constraint) Logic Programming (JJMN), p. 829.
ICLP-1995-NilssonH #higher-order #source code: Constructing Logic Programs with Higher-Order Predicates (JFN, AH), p. 827.
ICLP-1995-PodelskiS #constraints #semantics #source code: Operational Semantics of Constraint Logic Programs with Coroutining (AP, GS), pp. 449–463.
ICLP-1995-RamakrishnanRSSW #performance #source code: Efficient Tabling Mechanisms for Logic Programs (IVR, PR, KFS, TS, DSW), pp. 697–711.
ICLP-1995-Sato #learning #semantics #source code #statistics: A Statistical Learning Method for Logic Programs with Distribution Semantics (TS), pp. 715–729.
ICLP-1995-Simonis #constraints: Applications of Constraint Logic Programming (HS), pp. 9–11.
ICLP-1995-TanL #source code #synthesis: Type Synthesis for Logic Programs (JT, IPL), p. 823.
ICLP-1995-ToniK #abduction #reduction #source code: Reduction of Abductive Logic Programs to Normal Logic Programs (FT, RAK), pp. 367–381.
ICLP-1995-WakakiS: Computing Prioritized Circumscription by Logic Programming (TW, KS), pp. 283–297.
ICLP-1995-YuanY #approach #on the: On Coherence Approach to Logic Program Revision (LYY, JHY), pp. 167–181.
ICLP-1995-ZhaoCU #analysis #concurrent #dependence #source code: Program Dependence Analysis of Concurrent Logic Programs and Its Applications (JZ, JC, KU), p. 825.
ICLP-1995-Zhou #approach: A Logic Programming Approach to Channel Routing (NFZ), pp. 217–231.
ILPS-1995-BandaMS #analysis #performance #scheduling #source code: Efficient Analysis of Logic Programs with Dynamic Scheduling (MJGdlB, KM, PJS), pp. 417–431.
ILPS-1995-BarklundDCL #encoding #semantics: Semantical Properties of Encodings in Logic Programming (JB, PD, SC, GAL), pp. 288–302.
ILPS-1995-BekkersT #monad: Monadic Constructs for Logic Programming (YB, PT), pp. 51–65.
ILPS-1995-Brzoska: Temporal Logic Programming in Dense Time (CB), pp. 303–317.
ILPS-1995-DimopoulosK: Logic Programming without Negation as Failure (YD, ACK), pp. 369–383.
ILPS-1995-FerrandL #composition #correctness #proving #source code: A Compositional Proof Method of Partial Correctness for Normal Logic Programs (GF, AL), pp. 209–223.
ILPS-1995-GallagherBS #modelling #source code #static analysis: Practical Model-Based Static Analysis for Definite Logic Programs (JPG, DB, HS), pp. 351–365.
ILPS-1995-Gurr #declarative #source code: Declarative Annotations for Logic Programs (CAG), p. 639.
ILPS-1995-JaffarMN #case study #modelling: Logic Programming and Object Modelling: A Case Study (JJ, MJM, GN), p. 48.
ILPS-1995-JanssensBD #abstract interpretation #automaton #constraints #source code: A Blueprint for an Abstract Machine for Abstract Interpretation of (Constraint) Logic Programs (GJ, MB, VD), pp. 336–350.
ILPS-1995-Kuchen #functional #implementation: Implementation Issues for Functional Logic Programming (HK), pp. 612–613.
ILPS-1995-LauO #approach #constraints #deduction #formal method #source code #synthesis: A Formal Approach to Deductive Synthesis of Constraint Logic Programs (KKL, MO), pp. 543–557.
ILPS-1995-LauOPP #correctness #program transformation #termination: Correctness of Logic Program Transformations Based on Existential Termination (KKL, MO, AP, MP), pp. 480–494.
ILPS-1995-MarchioriT #proving #source code #termination: Proving Termination of Logic Programs with Delay Declarations (EM, FT), pp. 447–461.
ILPS-1995-MessingS #source code: Regular Signed Resolution Applied to Annotated Logic Programs (BM, PvS), p. 638.
ILPS-1995-PedroM #approach #verification: An Approach to Verification in Contextual Logic Programming (VP, LM), p. 634.
ILPS-1995-Prehofer #call-by #functional #higher-order: A Call-by-Need Strategy for Higher-Order Functional-Logic Programming (CP), pp. 147–161.
ILPS-1995-TseWL #concurrent #object-oriented #programming language #prolog: P&P: A Combined Parlog and Prolog Concurrent Object-Oriented Logic Programming Language (MlT, WhW, HfL), p. 640.
ILPS-1995-WinikoffH #implementation #linear #programming language: Implementing the Linear Logic Programming Language Lygon (MW, JH), pp. 66–80.
ILPS-1995-YouGYG #framework #source code: An Introspective Framework for Paraconsistent Logic Programs (JHY, SG, LYY, RG), pp. 384–398.
LICS-1995-NadathurL #proving: Uniform Proofs and Disjunctive Logic Programming (GN, DWL), pp. 148–155.
LICS-1995-Tronci #functional #hardware #verification: Hardware Verification, Boolean Logic Programming, Boolean Functional Programming (ET), pp. 408–418.
PODS-1994-Sohn #constraints #source code: Constraints among Argument Sizes in Logic Programs (KS), pp. 68–74.
ICML-1994-KietzL #algorithm #induction #performance: An Efficient Subsumption Algorithm for Inductive Logic Programming (JUK, ML), pp. 130–138.
ICML-1994-Muggleton #induction: Bayesian Inductive Logic Programming (SM), pp. 371–379.
ICML-1994-ZelleMK #bottom-up #induction #top-down: Combining Top-down and Bottom-up Techniques in Inductive Logic Programming (JMZ, RJM, JBK), pp. 343–351.
KR-1994-DamasioNP #knowledge base #named: REVISE: An Extended Logic Programming System for Revising Knowledge Bases (CVD, WN, LMP), pp. 607–618.
SEKE-1994-ArndtGPT #execution #source code #symbolic computation: Symbolic execution of logic programs (TA, AG, GP, GT), pp. 414–421.
SEKE-1994-CookeDGK #concurrent #linear #source code: Bag languages, concurrency, Horn logic programs, and linear logic (DEC, RD, AQG, VK), pp. 289–297.
ECOOP-1994-OmiciniN #object-oriented: Object-Oriented Computations in Logic Programming (AO, AN), pp. 194–212.
ALP-1994-Marchiori #source code #term rewriting: Logic Programs as term Rewriting Systems (MM), pp. 223–241.
ALP-1994-Marchiori94a #alias #source code: A Logic for Variable Aliasing in Logic Programs (EM), pp. 287–304.
ALP-1994-Miller #multi #source code #specification #using: Specifications Using Multiple-Conclusion Logic Programs (DM), pp. 3–4.
ALP-1994-Teusink #abduction #source code: Three-Valued Completion for Abductive Logic Programs (FT), pp. 150–167.
ALP-1994-Volpe #concurrent #linear #proving: Concurrent Logic Programming as Uniform Linear Proofs (PV), pp. 133–149.
LOPSTR-1994-BarklundBD #multi #programming language: A Basis for a Multi-Level Meta-Logic Programming Language (JB, KB, PD), pp. 262–275.
LOPSTR-1994-Basin #framework #source code: Logic Frameworks for Logic Programs (DAB), pp. 1–16.
LOPSTR-1994-BoulangerB #analysis #program transformation #using: Using Call/Exit Analysis for Logic Program Transformation (DB, MB), pp. 36–50.
LOPSTR-1994-BrogiC #metalanguage #source code: Gödel as a Meta-Language for Composing Logic Programs (AB, SC), pp. 377–394.
LOPSTR-1994-CominiLV #debugging: Abstract Debugging of Logic Program (MC, GL, GV), pp. 440–450.
LOPSTR-1994-LauO #deduction #framework #on the #source code #specification #synthesis: On Specification Frameworks and Deductive Synthesis of Logic Programs (KKL, MO), pp. 104–121.
LOPSTR-1994-MarakakisG #data type #design #source code #top-down #using: Schema-Based Top-Down Design of Logic Programs Using Abstract Data Types (EIM, JPG), pp. 138–153.
LOPSTR-1994-Mircheva #source code #testing: Logic Programs with Tests (MM), pp. 276–292.
LOPSTR-1994-SakamaS #approach #declarative #deduction #source code: Partial Deduction of Disjunctive Logic Programs: A Declarative Approach (CS, HS), pp. 170–182.
LOPSTR-1994-TarauD #continuation #first-order: Logic Programming and Logic Grammars with First-Order Continuations (PT, VD), pp. 215–230.
PLILP-1994-FagesFS #constraints #optimisation #relational: Handling Preferences in Constraint Logic Programming with Relational Optimization (FF, JF, TS), pp. 261–276.
PLILP-1994-Fruhwirth #constraints #reasoning: Annotated Constraint Logic Programming Applied to Temporal Reasoning (TWF), pp. 230–243.
PLILP-1994-Miller #multi #source code #specification #using: Specifications Using Multiple-Conclusion Logic Programs (DM), pp. 3–4.
POPL-1994-CortesiCH #abstract domain: Combinations of Abstract Domains for Logic Programming (AC, BLC, PVH), pp. 227–239.
POPL-1994-MarriottBH #scheduling #source code: Analyzing Logic Programs with Dynamic Scheduling (KM, MJGdlB, MVH), pp. 240–253.
POPL-1994-Paakki #execution #functional #multi #source code: Multi-Pass Execution of Functional Logic Programs (JP), pp. 361–374.
POPL-1994-Qian #equation #higher-order: Higher-Order Equational Logic Programming (ZQ), pp. 254–267.
SAS-1994-AikenL #source code #type checking: Directional Type Checking of Logic Programs (AA, TKL), pp. 43–60.
SAS-1994-CodishD #dependence #multi #polymorphism #source code #using: Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop (MC, BD), pp. 281–296.
SAS-1994-DebrayGHL #source code: Estimating the Computational Cost of Logic Programs (SKD, PLG, MVH, NWL), pp. 255–265.
SAS-1994-HanusZ #analysis #functional #source code: Mode Analysis of Functional Logic Programs (MH, FZ), pp. 26–42.
KBSE-1994-LoiaQ #object-oriented #paradigm: Integrating Object-Oriented Paradigms and Logic Programming: The OPLA Language (VL, MQ), pp. 158–164.
SAC-1994-ChangCG #abstract interpretation #bottom-up #execution #source code: Abstract filters: improving bottom-up execution of logic programs by two-phase abstract interpretation (BMC, KMC, RG), pp. 388–393.
SAC-1994-GabbrielliG #analysis #source code: Goal independency and call patterns in the analysis of logic programs (MG, RG), pp. 394–399.
SAC-1994-LeeL #concurrent #constraints #incremental #named #nondeterminism #query #towards: IQ: towards incremental query processing in non-deterministic concurrent constraint logic programming (JHML, HfL), pp. 405–409.
SAC-1994-WassermanS #locality: The locality principle and completeness in logic programming (HCW, ZS), pp. 286–291.
CC-1994-Hanus #functional #optimisation #source code #towards: Towards the Global Optimization of Functional Logic Programs (MH), pp. 68–82.
CC-1994-JanssensS #abstract interpretation #constraints #implementation #on the #source code: On the Implementation of Abstract Interpretation Systems for (Constraint) Logic Programs (GJ, WS), pp. 172–187.
PDP-1994-BirdC #communication #modelling #network #using: Modelling Logic Programming Using A Network Of Communicating Machines (PRB, AJC), pp. 156–161.
ESOP-1994-Andrews #constraints #implementation: Foundational Issues in Implementing Constraint Logic Programming Systems (JHA), pp. 74–88.
ESOP-1994-CorsiniR #constraints #model checking: Symbolic Model Checking and Constraint Logic Programming: a Cross-Fertilization (MMC, AR), pp. 180–194.
ESOP-1994-PierroP #constraints #logic #semantics: A Logical Denotational Semantics for Constraint Logic Programming (ADP, CP), pp. 195–210.
CADE-1994-WaalG #program analysis #program transformation #proving #theorem proving: The Applicability of Logic Program Analysis and Transformation to Theorem Proving (DAdW, JPG), pp. 207–221.
ICLP-1994-BigotGD #source code: Output Value Placement in Moded Logic Programs (PAB, DG, SKD), pp. 175–189.
ICLP-1994-CairesM #higher-order #polymorphism #unification: Higher-Order Polymorphic Unification for Logic Programming (LC, LM), pp. 419–433.
ICLP-1994-ClergerieL #named: LPDA: Another look at Tabulation in Logic Programming (EVdlC, BL), pp. 470–486.
ICLP-1994-DixGM #modelling #source code: Causal Models of Disjunctive Logic Programs (JD, GG, VWM), pp. 290–302.
ICLP-1994-GabbayGMO: Conditonal Logic Programming (DMG, LG, AM, NO), pp. 272–289.
ICLP-1994-GallagherW #approximate #performance #precise #source code: Fast and Precise Regular Approximations of Logic Programs (JPG, DAdW), pp. 599–613.
ICLP-1994-Guglielmi #concurrent #generative #programming language: Concurrency and Plan Generation in a Logic Programming Language with a Sequential Operator (AG), pp. 240–254.
ICLP-1994-GuptaHPC #execution #named #source code: ACE: And/Or-parallel Copying-based Execution of Logic Programs (GG, MVH, EP, VSC), pp. 93–109.
ICLP-1994-Jiang #logic #semantics: Ambivalent Logic as the Semantic Basis of Metalogic Programming (YJ), pp. 387–401.
ICLP-1994-KakasM #abduction: Abduction and Abductive Logic Programming (ACK, PM), pp. 18–19.
ICLP-1994-KakasMD #semantics #source code: The Acceptability Semantics for Logic Programs (ACK, PM, PMD), pp. 504–519.
ICLP-1994-LammaM #composition: Modularity in Logic Programming (EL, PM), pp. 15–17.
ICLP-1994-LauOT #deduction #problem #source code #synthesis: The Halting Problem for Deductive Synthesis of Logic Programs (KKL, MO, SÅT), pp. 665–683.
ICLP-1994-LauW #source code #specification #synthesis #tutorial: A Tutorial on Synthesis of Logic Programs from Specifications (KKL, GAW), pp. 11–14.
ICLP-1994-LeachL #source code: Computing Annotated Logic Programs (SML, JJL), pp. 257–271.
ICLP-1994-LifschitzT: Splitting a Logic Program (VL, HT), pp. 23–37.
ICLP-1994-McCainT #independence #source code: Language Independence and Language Tolerance in Logic Programs (NM, HT), pp. 38–57.
ICLP-1994-Mircheva #source code: Logic Programs with Refutation Rules (MM), p. 734.
ICLP-1994-Reddy #aspect-oriented #higher-order: Higher-order Aspects of Logic Programming (USR), pp. 402–418.
ICLP-1994-SakamaI #abduction #equivalence #on the #source code: On the Equivalence between Disjunctive and Abductive Logic Programs (CS, KI), pp. 489–503.
ICLP-1994-Thielscher #equation #representation: Representing Actions in Equational Logic Programming (MT), pp. 207–224.
ICLP-1994-Zapatrin #metric #quantum: Logic Programming as Quantum Measurement (RRZ), p. 747.
ILPS-1994-Brisset #polymorphism #programming language #type checking: Avoiding Dynamic Type Checking in a Polymorphic Logic Programming Language (PB), p. 674.
ILPS-1994-BroomeL #calculus #combinator: Combinatory Logic Programming: Computing in Relation Calculi (PB, JL), pp. 269–285.
ILPS-1994-ChiuL #constraints #theorem proving #towards: Towards Practical Interval Constraint Solving in Logic Programming (CKC, JHML), pp. 109–123.
ILPS-1994-Cras #constraints #using: Using Constraint Logic Programming in Services: A Few Short Tales (YC), pp. 3–16.
ILPS-1994-DebrayGB #detection #optimisation #source code: Detection and Optimization of Suspension-free Logic Programs (SKD, DG, PAB), pp. 487–501.
ILPS-1994-Dutra #parallel #scheduling: Strategies for Scheduling And- and Or-Parallel Work in Parallel Logic Programming Systems (IdCD), pp. 289–304.
ILPS-1994-Gervet #constraints #finite #named #set: Conjunto: Constraint Logic Programming with Finite Set Domains (CG), pp. 339–358.
ILPS-1994-Giacobazzi #abduction #analysis #composition #source code: Abductive Analysis of Modular Logic Programs (RG), pp. 377–391.
ILPS-1994-Gottlob #complexity #power of: Complexity and Expressive Power of Disjunctive Logic Programming (GG), pp. 23–42.
ILPS-1994-Jones #abstract interpretation #functional #partial evaluation: Abstract Interpretation and Partial Evaluation in Functional and Logic Programming (NDJ), pp. 17–22.
ILPS-1994-Lever #constraints: Constraint Logic Programming for Planning (JML), p. 679.
ILPS-1994-Lloyd #functional #programming language: Combining Functional and Logic Programming Languages (JWL), pp. 43–57.
ILPS-1994-Malfon #semantics #source code #validation: Characterization of Some Semantics for Logic Programs with Negation and Applications to Program Validation (BM), pp. 91–105.
ILPS-1994-MichaylovP #compilation #constraints #linear #optimisation #source code: Optimizing Compilation of Linear Arithmetic in a Class of Constraint Logic Programs (SM, BP), pp. 586–600.
ILPS-1994-Post: Mutally Exclusive Rules in Logic Programming (KP), pp. 472–486.
ILPS-1994-Rajasekar #constraints #string #theory and practice: Constraint Logic Programming on Strings: Theory and Applications (AR), p. 681.
ILPS-1994-RosenbluethP #lr #parsing #source code: LR Inference: Inference Systems for Fixed-Mode Logic Programs, Based on LR Parsing (DAR, JCP), pp. 439–453.
ILPS-1994-TangPGC #backtracking #optimisation #parallel #performance: Last Parallel Call Optimization and Fast Backtracking in And-parallel Logic Programming Systems (DT, EP, GG, MC), pp. 683–684.
ILPS-1994-Turner #source code: Signed Logic Programs (HT), pp. 61–75.
ICALP-1993-CodishFMW #analysis #concurrent #constraints #performance #source code: Efficient Analysis of Concurrent Constraint Logic Programs (MC, MF, KM, WHW), pp. 633–644.
SEKE-1993-LoiaQ #named #object-oriented: CLOS: A Key Issue To Bridge the Gap Between Object-Oriented and Logic Programming (VL, MQ), pp. 62–69.
SEKE-1993-Maim #abduction #constraints #source code #strict: Restricted Abduction in Constraint Logic Programs (EM), pp. 222–224.
LOPSTR-1993-BergadanoG #induction #source code #synthesis: Inductive Synthesis of Logic Programs and Inductive Logic Programming (FB, DG), pp. 45–56.
LOPSTR-1993-Gurr #programming language #representation: Specialising the Ground Representation in the Logic Programming Language Gödel (CAG), pp. 124–140.
LOPSTR-1993-LauO #deduction #source code #specification #synthesis: A Formal View of Specification, Deductive Synthesis and Transformation of Logic Programs (KKL, MO), pp. 10–31.
PEPM-1993-Gallagher #source code #tutorial: Tutorial on Specialisation of Logic Programs (JPG), pp. 88–98.
PLILP-1993-AlpuenteFRV #approximate #equation #optimisation #source code: Narrowing Approximations as an Optimization for Equational Logic Programs (MA, MF, MJR, GV), pp. 391–409.
PLILP-1993-Boye #functional #source code: Avoiding Dynamic Delays in Functional Logic Programs (JB), pp. 12–27.
PLILP-1993-HanusJ #debugging #functional #source code: A Debugging Model for Functional Logic Programs (MH, BJ), pp. 28–43.
PLILP-1993-LimS #approach #constraints #metaprogramming: A Conservative Approach to Meta-Programming in Constraint Logic Programming (PL, JS), pp. 44–59.
PLILP-1993-NataliO: Objects with State in Contextual Logic Programming (AN, AO), pp. 220–234.
POPL-1993-BossiB #difference: Differential Logic Programming (AB, MB, MG, GL, MCM), pp. 359–370.
POPL-1993-CodishDG #analysis #composition #source code: Compositional Analysis of Modular Logic Programs (MC, SKD, RG), pp. 451–464.
POPL-1993-MarriottS #constraints #optimisation #order #refinement #source code: The 3 R’s of Optimizing Constraint Logic Programs: Refinement, Removal and Reordering (KM, PJS), pp. 334–344.
WSA-1993-BoyePM #functional #source code #synthesis: Synthesis of Directionality Information for Functional Logic Programs (JB, JP, JM), pp. 165–177.
WSA-1993-Roy #challenge #source code #static analysis: Challenges in Developing Useful and Practical Static Analysis for Logic Programs (PVR), p. 111.
SAC-1993-Yalcinalp #named: Ushell: An Environment for Introduction to Logic Programming (LÜY), pp. 598–603.
TAPSOFT-1993-AndreoliLPT #communication #concurrent #linear #programming language #semantics: True Concurrency Semantics for a Linear Logic Programming Language with Braodcast Communication (JMA, LLT, RP, BT), pp. 182–198.
ICLP-1993-BenhamouM #constraints #equation #pseudo: Boolean Pseudo-equations in Constraint Logic Programming (FB, JLM), pp. 517–531.
ICLP-1993-BonnerK #transaction: Transaction Logic Programming (AJB, MK), pp. 257–279.
ICLP-1993-Brzoska #bound: Temporal Logic Programming with Bounded Universal Modality Goals (CB), pp. 239–256.
ICLP-1993-CarroGH #execution #paradigm #parallel #source code #visualisation: Some Paradigms for Visualizing Parallel Execution of Logic Programs (MC, LMGH, MVH), pp. 184–200.
ICLP-1993-CodishDFB #analysis #correctness #question #source code: Freeness Analysis for Logic Programs — And Correctness? (MC, DD, GF, MB), pp. 116–131.
ICLP-1993-DawsonRRS #source code: Extracting Determinacy in Logic Programs (SD, CRR, IVR, RCS), pp. 424–438.
ICLP-1993-Dung #database #representation: Representing Actions in Logic Programming and Its Applications in Database Updates (PMD), pp. 222–238.
ICLP-1993-Dung93a #semantics: An Argumentation Semantics for Logic Programming with Explicit Negation (PMD), pp. 616–630.
ICLP-1993-InoueS #abduction #source code: Transforming Abductive Logic Programs to Disjunctive Programs (KI, CS), pp. 335–353.
ICLP-1993-KossovskyS #backtracking: Function-Patterns and Fan-Backtracking for Logic Programming (NKK, IPS), p. 843.
ICLP-1993-KraanBB #reasoning #synthesis: Middle-Out Reasoning for Logic Program Synthesis (IK, DAB, AB), pp. 441–455.
ICLP-1993-KusalikO #towards #visualisation: Towards Generalized Visualization Support for Logic Programming (AJK, GMO), p. 844.
ICLP-1993-LadretR #protocol #testing: Contribution of Logic Programming to Support Telecommunications Protocol Tests (DL, MR), pp. 845–846.
ICLP-1993-LauO #deduction #source code #synthesis: An Incompleteness Result for Deductive Synthesis of Logic Programs (KKL, MO), pp. 456–477.
ICLP-1993-Luttringhaus-Kappel #generative #source code: Control Generation for Logic Programs (SLK), pp. 478–495.
ICLP-1993-Maher: A Logic Programming View of CLP (MJM), pp. 737–753.
ICLP-1993-MeklyY #approach #automation #generative #modelling #requirements #testing: A Logic Programming Approach to Requirements Modelling and Automated Test Generation (LJM, MPY), p. 849.
ICLP-1993-NerodeK #constraints #hybrid: Hybrid Systems and Constraint Logic Programming (AN, WK), pp. 18–24.
ICLP-1993-PintoR #calculus #reasoning: Temporal Reasoning in Logic Programming: A Case for the Situation Calculus (JP, RR), pp. 203–221.
ICLP-1993-Reviakin #prolog: Logic Programming System Prolog-plus (MR), p. 850.
ICLP-1993-SakamaI #source code: Negation in Disjunctive Logic Programs (CS, KI), pp. 703–719.
ICLP-1993-Smith #multi #named: MultiLog: Data Or-Parallel Logic Programming (DAS), pp. 314–331.
ICLP-1993-Turner #source code #theorem: A Monotonicity Theorem for Extended Logic Programs (HT), pp. 567–585.
ILPS-1993-AguzziM #source code #term rewriting #termination: Termination of Logic Programs via Equivalent Rewrite Systems (GA, UM), p. 634.
ILPS-1993-AndreoliCP #abstract interpretation #linear: Abstract Interpretation of Linear Logic Programming (JMA, TC, RP), pp. 295–314.
ILPS-1993-BaldoniGM #multimodal: A Multimodal Logic to Define Modules in Logic Programming (MB, LG, AM), pp. 473–487.
ILPS-1993-BandaHM #constraints #independence #source code: Independence in Constraint Logic Programs (MJGdlB, MVH, KM), pp. 130–146.
ILPS-1993-BaralGK #approximate #source code: Approximating General Logic Programs (CB, MG, OK), pp. 181–198.
ILPS-1993-Bsaies #automation #performance #source code: Automated Derivation of Efficient Logic Programs by Synthesizing Eureka Properties (KB), p. 633.
ILPS-1993-CodishD #source code #using: Analysing Logic Programs Using “Prop”-ositional Logic Programs and a Magic Wand (MC, BD), pp. 114–129.
ILPS-1993-Debray #source code #static analysis: Static Analysis of Logic Programs (SKD), pp. 43–44.
ILPS-1993-DeneckerS #abduction #information management #representation: Representing Incomplete Knowledge in Abductive Logic Programming (MD, DDS), pp. 147–163.
ILPS-1993-EiterG #complexity #logic: Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics (TE, GG), pp. 266–278.
ILPS-1993-Fitting #metric #semantics #source code: Metric Methods in the Semantics of Logic Programs (MF), pp. 69–71.
ILPS-1993-KobayashiY #concurrent #linear #named #paradigm: ACL — A Concurrent Linear Logic Programming Paradigm (NK, AY), pp. 279–294.
ILPS-1993-LifschitzMT #approach #automation #reasoning: Automated Reasoning About Actions: A Logic Programming Approach (VL, NM, HT), p. 641.
ILPS-1993-MorenoPM #natural language: The Incorporation of Logic Formalisms to Natural Language Through Logic Programming (LM, MP, AM), p. 671.
ILPS-1993-Nilsson #bottom-up #evaluation #source code: Goal-directed Bottom-up Evaluation of Normal Logic Programs (UN), p. 647.
ILPS-1993-Orgun: The Soundness and Completeness of a Temporal Extension of Logic Programming (MAO), p. 669.
ILPS-1993-Raedt #induction: A Brief Introduction to Inductive Logic Programming (LDR), pp. 45–51.
ILPS-1993-Sohn #analysis #relational #source code: Relational Groundness Analysis for Logic Programs (KS), p. 635.
ILPS-1993-Teusink #proving #source code: A Proof Procedure for Extended Logic Programs (FT), pp. 235–249.
ILPS-1993-TongL #concurrent #constraints #parallel: Concurrent Constraint Logic Programming On Massively Parallel SIMD Computers (BMT, HfL), pp. 388–402.
ILPS-1993-WaalG: Logic Program Specialisation With Deletion of Useless Clauses (DAdW, JPG), p. 632.
ILPS-1993-WassermanYS #deduction: The Essential Inadequacy of Deductions in Logic Programming (HCW, KY, ZS), p. 644.
ILPS-1993-YouY #source code: Contradiction Resolving for Extended Logic Programs and Default Theories (JHY, LYY), p. 640.
PODS-1992-BeeriRSS #semantics #source code: The Valid Model Semantics for Logic Programs (CB, RR, DS, SS), pp. 91–104.
ICALP-1992-Debray #analysis #complexity #data flow #on the #source code: On the Complexity of Dataflow Analysis of Logic Programs (SKD), pp. 509–520.
ICALP-1992-LaenensVZ #semantics: Logic Programming Semantics Made Easy (EL, DV, CZ), pp. 499–508.
KR-1992-Dix #framework #representation #semantics #source code: A Framework for Representing and Characterizing Semantics of Logic Programs (JD), pp. 591–602.
ML-1992-HoggerB #approach #heuristic #learning #source code: The MENTLE Approach to Learning Heuristics for the Control of Logic Programs (EIH, KB), pp. 212–217.
SEKE-1992-ShimuraLM #petri net #semantics #source code: A Petri Net Semantics for Logic Programs with Negation (TS, JL, TM), pp. 292–299.
ECOOP-1992-Uustalu #approach #object-oriented #paradigm: Combining Object-Oriented and Logic Paradigms: A Modal Logic Programming Approach (TU), pp. 98–113.
ALP-1992-AravindanD #deduction #semantics #source code: Partial Deduction of Logic Programs wrt Well-Founded Semantics (CA, PMD), pp. 384–402.
ALP-1992-Balbiani: The Finiteness of Logic Programming Derivations (PB), pp. 403–419.
ALP-1992-Hong #constraints: Non-linear Real Constraints in Constraint Logic Programming (HH), pp. 201–212.
ALP-1992-KingS #analysis #concurrent #source code: Serialisation Analysis of Concurrent Logic Programs (AK, PS), pp. 322–334.
ALP-1992-Lopez-Fraguas #constraints #functional: A General Scheme for Constraint Functional Logic Programming (FJLF), pp. 213–227.
ALP-1992-Maher: A CLP View of Logic Programming (MJM), pp. 364–383.
ALP-1992-Meseguer #multi #paradigm: Multiparadigm Logic Programming (JM), pp. 158–200.
LOPSTR-1992-BoulangerB #abstract interpretation #source code #using: Deriving Transformations for Logic Programs Using Abstract Interpretation (DB, MB), pp. 99–117.
LOPSTR-1992-FribourgO #induction #source code: A Unifying View of Structural Induction and Computation Induction for Logic Programs (LF, HO), pp. 46–60.
LOPSTR-1992-GallagherW #source code: Deletion of Redundant Unary Type Predicates from Logic Programs (JPG, DAdW), pp. 151–167.
LOPSTR-1992-KraanBB #proving #synthesis #theorem proving: Logic Program Synthesis via Proof Planning (IK, DAB, AB), pp. 1–14.
LOPSTR-1992-ProiettiP #incremental #source code: Best-first Strategies for Incremental Transformations of Logic Programs (MP, AP), pp. 82–98.
PEPM-1992-Bsaies #framework #program transformation #synthesis: A Framework for Mechanizing Logic Program Transformation: The Synthesis of Eureka-Properties (KB), pp. 108–115.
PEPM-1992-ShermanS #equation #source code: Call Unfolding Strategies for Equational Logic Programs (DS, RS), pp. 48–53.
PLDI-1992-TanL #analysis #compilation #data flow #source code: Compiling Dataflow Analysis of Logic Programs (JT, IPL), pp. 106–115.
PLILP-1992-Alexandre #source code: A technique for Transforming Logic Programs by Fold-Unfold Transformations (FA), pp. 202–216.
PLILP-1992-AlpuenteFM #analysis #consistency #equation #incremental #nondeterminism: Analyses of Inconsistency for Incremental Equational Logic Programming (MA, MF, FM), pp. 443–457.
PLILP-1992-Hamel #equation #named: UCG-E: An Equational Logic Programming System (LHH), pp. 473–474.
PLILP-1992-Hanus #functional #source code #using: Improving Control of Logic Programs by Using Functional Logic Languages (MH), pp. 1–23.
PLILP-1992-HenrardC #declarative #named #source code: FOLON: An Environment for Declarative Construction of Logic Programs (JH, BLC), pp. 217–231.
PLILP-1992-Hoa #bottom-up #higher-order #interpreter #programming language: A Bottom-Up Interpreter for a Higher-Order Logic Programming Language (AHBH), pp. 326–340.
PLILP-1992-LindstromMO #functional: Our LIPS Are Sealed: Interfacing Functional and Logic Programming Systems (GL, JM, TO), pp. 428–442.
PLILP-1992-Muck #automaton #functional #named #source code: CAMEL: An Extension of the Categorial Abstract Machine to Compile Functional/Logic Programs (AM), pp. 341–354.
PLILP-1992-Plaza #declarative: Fully Declarative Logic Programming (JAP), pp. 415–427.
WSA-1992-CodishFMW #analysis #concurrent #constraints #performance #source code: Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs (MC, MF, KM, WHW), pp. 35–42.
WSA-1992-Gallagher #specification #static analysis: Static Analysis for Logic Program Specification (JPG), pp. 285–294.
WSA-1992-Hanus #abstract interpretation #algorithm #source code: An Abstract Interpretation Algorithm for Residuating Logic Programs (MH), pp. 304–312.
IWMM-1992-BekkersRU #memory management #programming language: Dynamic Memory Management for Sequential Logic Programming Languages (YB, OR, LU), pp. 82–102.
IWMM-1992-DuvvuruSTSHZ #concurrent #source code: A Compile-Time Memory-Reuse Scheme for Concurrent Logic Programs (SD, RS, ET, AVSS, LH, XZ), pp. 264–276.
CSL-1992-Gonzalez-MorenoHR #functional #on the #semantics: On the Completeness of Narrowing as the Operational Semantics of Functional Logic Programming (JCGM, MTHG, MRA), pp. 216–230.
CSL-1992-Stark #source code: Negation-Complete Logic Programs (RFS), pp. 403–409.
JICSLP-1992-AlferesP #on the #semantics: On Logic Program Semantics with Two Kinds of Negation (JJA, LMP), pp. 574–588.
JICSLP-1992-Ben-EliyahuD #source code: Propositional Sematics for Disjunctive Logic Programs (RBE, RD), pp. 813–827.
JICSLP-1992-Bonatti #framework #logic #semantics #source code: Autoepistemic Logics as a Unifying Framework for the Semantics of Logic Programs (PAB), pp. 417–430.
JICSLP-1992-BrogiLMM #source code: Normal Logic Programs as Open Positive Programs (AB, EL, PM, PM), pp. 783–797.
JICSLP-1992-BronsardLR #framework #proving #source code #termination: A Framework of Directionality for Proving Termination of Logic Programs (FB, TKL, USR), pp. 321–335.
JICSLP-1992-Bugliesi #declarative #inheritance: A Declarative View of Inheritance in Logic Programming (MB), pp. 113–127.
JICSLP-1992-Dix #semantics #source code: Classifying Semantics of Disjunctive Logic Programs (JD), pp. 798–812.
JICSLP-1992-FerrandD #correctness #proving #source code: Proof Method of Partial Correctness and Weak Completeness for Normal Logic Programs (GF, PD), pp. 161–174.
JICSLP-1992-Fitting #semantics: Many-Valued Semantics for Logic Programming (MF), pp. 23–24.
JICSLP-1992-GabbrielliLM #source code: Observational Equivalences for Logic Programs (MG, GL, MCM), pp. 131–145.
JICSLP-1992-GelfondL #representation: Representing Actions in Extended Logic Programming (MG, VL), pp. 559–573.
JICSLP-1992-GiordanoO: Negation as Failure in Intuitionistic Logic Programming (LG, NO), pp. 431–445.
JICSLP-1992-GrogerP #automation #proving #recursion #source code #termination: Handling of Mutual Recursion in Automatic Termination Proofs for Logic Programs (GG, LP), pp. 336–350.
JICSLP-1992-GrosseHSST #equation: Equational Logic Programming Actions, and Change (GG, SH, JS, UCS, MT), pp. 177–191.
JICSLP-1992-Harland #equivalence #normalisation #on the #source code: On Normal Forms and Equivalence for Logic Programs (JH), pp. 146–160.
JICSLP-1992-Hodas #dependence #programming language #semiparsing #specification: Specifying Filler-Gap Dependency Parsers in a Linear-Logic Programming Language (JSH), pp. 622–636.
JICSLP-1992-JacquetM #communication #towards: Communicating Clauses: Towards Synchronous Communication in Contextual Logic Programming (JMJ, LM), pp. 98–112.
JICSLP-1992-KempSS #bottom-up #evaluation #query #source code #strict: Query Restricted Bottom-Up Evaluation of Normal Logic Programs (DBK, PJS, DS), pp. 288–302.
JICSLP-1992-KingS #analysis #concurrent #source code: Schedule Analysis of Concurrent Logic programs (AK, PS), pp. 478–492.
JICSLP-1992-MamedeM #reasoning #taxonomy: A Contraint Logic Programming Scheme for Taxonomic Reasoning (MM, LM), pp. 255–269.
JICSLP-1992-MarekNR #modelling: The Stable Models of a Predicate Logic Program (VWM, AN, JBR), pp. 446–460.
JICSLP-1992-Overbeek #analysis #search-based #sequence #tutorial: Logic Programming and Genetic Sequence Analysis: a Tutorial (RAO), pp. 32–34.
JICSLP-1992-SatohI #abduction #evaluation #query: A Query Evaluation Method for Abductive Logic Programming (KS, NI), pp. 671–685.
JICSLP-1992-SmolkaT: Records for Logic Programming (GS, RT), pp. 240–254.
JICSLP-1992-SundararajanST #analysis #concurrent #source code #thread: Variable Threadedness Analysis for Concurrent Logic Programs (RS, AVSS, ET), pp. 493–508.
JICSLP-1992-Tick #concurrent #tutorial: Advanced Tutorial: Concurrent Logic Programming (ET), p. 25.
JICSLP-1992-Wiggins #development #proving #source code #synthesis: Synthesis and Transformation of Logic Programs in the Whelk Proof Development System (GAW), pp. 351–365.
LICS-1992-HeintzeJ #program analysis: An Engine for Logic Program Analysis (NH, JJ), pp. 318–328.
PODS-1991-BrodskyS #constraints #difference #source code: Inference of Inequality Constraints in Logic Programs (AB, YS), pp. 227–240.
PODS-1991-GangulyGZ: Minimum and Maximum Predicates in Logic Programming (SG, SG, CZ), pp. 154–163.
PODS-1991-Ross #composition #recursion #source code: Modular Acyclicity and Tail Recursion in Logic Programs (KAR), pp. 92–101.
PODS-1991-SohnG #detection #source code #termination #using: Termination Detection in Logic Programs using Argument Sizes (KS, AVG), pp. 216–226.
SIGMOD-1991-SudarshanSRN #bottom-up #evaluation #optimisation #source code: Space Optimization in the Bottom-Up Evaluation of Logic Programs (SS, DS, RR, JFN), pp. 68–77.
ICALP-1991-ChenH: Logic Programming with Recurrence Domains (HC, JH), pp. 20–34.
ICALP-1991-GabbrielliL #on the #semantics #source code: On the Semantics of Logic Programs (MG, GL), pp. 1–19.
KR-1991-GabbayLV #order #semantics #source code: Credulous vs. Sceptical Semantics for Ordered Logic Programs (DMG, EL, DV), pp. 208–217.
ML-1991-KijsirikulNS #learning #performance #source code: Efficient Learning of Logic Programs with Non-determinant, Non-discriminating Literals (BK, MN, MS), pp. 417–421.
ML-1991-Quinlan #induction: Determinate Literals in Inductive Logic Programming (JRQ), pp. 442–446.
LOPSTR-1991-AlexandreBQ #on the #source code #using: On Using Mode Input-output for Transforming Logic Programs (FA, KB, AQ), pp. 129–146.
LOPSTR-1991-Antoy #evaluation #lazy evaluation #nondeterminism: Non-Determinism and Lazy Evaluation in Logic Programming (SA), pp. 318–331.
LOPSTR-1991-Eusterbrock #abstraction #learning #source code: Speed-up Transformations of Logic Programs by Abstraction and Learning (JE), pp. 167–182.
LOPSTR-1991-FlenerD #synthesis #towards: Towards Stepwise, Schema-guided Synthesis of Logic Programms (PF, YD), pp. 46–64.
LOPSTR-1991-FuchsF #source code: Schema-Based Transfomations of Logic Programs (NEF, MPJF), pp. 111–125.
LOPSTR-1991-LecoutreDL #abstract interpretation #behaviour #recursion #source code: Abstract Interpretation and Recursive Behaviour of Logic Programs (CL, PD, PL), pp. 147–166.
LOPSTR-1991-ProiettiP #automation #source code: An Automatic Transfomation Strategy for Avoiding Unnecessary Variables in Logic Programs (MP, AP), pp. 126–128.
LOPSTR-1991-Schaeck #algorithm #constraints #framework: Global Search Algorithms and the Constraint Logic Programming Framework (SS), pp. 252–253.
LOPSTR-1991-WigginsBKH #induction #proving #source code #synthesis: Synthesis and Transfomation of Logic Programs from Constructive, Inductive Proof (GAW, AB, IK, JH), pp. 27–45.
PEPM-1991-CortesiF #abstract domain #abstract interpretation #analysis #source code: Abstract Interpretation of Logic Programs: An Abstract Domain for Groundness, Sharing, Freeness and Compoundness Analysis (AC, GF), pp. 52–61.
PEPM-1991-Smith #constraints #partial evaluation #pattern matching #programming language: Partial Evaluation of Pattern Matching in Constraint Logic Programming Languages (DAS), pp. 62–71.
PLILP-1991-Boye #named #semantics #source code: S-SLD-resolution — An Operational Semantics for Logic Programs with External Procedures (JB), pp. 383–393.
PLILP-1991-ChenW #abstraction #compilation #higher-order: Compilation of Predicate Abstractions in Higher-Order Logic Programming (WC, DSW), pp. 287–298.
PLILP-1991-ErtlK #constraints #scheduling #using: Optimal Instruction Scheduling using Constraint Logic Programming (MAE, AK), pp. 75–86.
PLILP-1991-HentenryckD #constraints #finite #semantics: Operational Semantics of Constraint Logic Programming over Finite Domains (PVH, YD), pp. 395–406.
PLILP-1991-Loyola #animation #debugging #execution: Extending Execution Trees for Debugging and Animation in Logic Programming (DL), pp. 419–420.
PLILP-1991-Paakki #attribute grammar #named: PROFIT: A System Integrating Logic Programming and Attribute Grammars (JP), pp. 243–254.
PLILP-1991-ProiettiP #named #order #source code: Unfolding — Definition — Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs (MP, AP), pp. 347–358.
PLILP-1991-Vollmer #case study #compilation #experience #performance: Experiences with Gentle: Efficient Compiler Construction Based On Logic Programming (JV), pp. 425–426.
PLILP-1991-Yamasaki #functional: Extraction of Functional from Logic Program (SY), pp. 27–38.
WSA-1991-DenisD #fixpoint #semantics #source code: Unfolding, Procedural and Fixpoint Semantics of Logic Programs (FD, JPD), pp. 157–164.
CAAP-1991-CorradiniRP #graph grammar: Logic Programming as Hypergraph Rewriting (AC, FR, FPP), pp. 275–295.
CCPSD-1991-BossiCF #proving #source code #termination: Proving Termination of Logic Programs by Exploiting Term Properties (AB, NC, MF), pp. 153–180.
CCPSD-1991-Hanus #order #parametricity: Parametric Order-Sorted Types in Logic Programming (MH), pp. 181–200.
CSL-1991-RaoKS #proving #source code #termination: A Transformational Methodology for Proving Termination of Logic Programs (MRKKR, DK, RKS), pp. 213–226.
ICLP-1991-BachmairG #semantics #similarity #source code: Perfect Model Semantics for Logic Programs with Equality (LB, HG), pp. 645–659.
ICLP-1991-Bottcher #on the #programming language #transaction: On Transactions in Logic Programming Languages (SB), p. 889.
ICLP-1991-ChabrierPL #constraints #programming language: Applications of Constraints Logic Programming Languages (JJC, CP, BL), p. 944.
ICLP-1991-CodishFM #analysis #concurrent #source code: Suspension Analysis for Concurrent Logic Programs (MC, MF, KM), pp. 331–345.
ICLP-1991-ColussiM #axiom #correctness #proving #semantics #source code #using: Proving Correctness of Logic Programs Using Axiomatic Semantics (LC, EM), pp. 629–642.
ICLP-1991-Cousot #abstract interpretation #source code: Abstract Interpretation of Logic Programs (PC), p. 940.
ICLP-1991-DebrayL #analysis #automation #complexity #source code: Automatic Complexity Analysis of Logic Programs (SKD, NWL), pp. 599–613.
ICLP-1991-DevilleSD #development: Software Development and Logic Programming (YD, LS, PD), p. 941.
ICLP-1991-DovierOPR #finite #programming language #set: {log}: A Logic Programming Language with Finite Sets (AD, EGO, EP, GR), pp. 111–124.
ICLP-1991-DuboisLP #towards: Towards Possibilistic Logic Programming (DD, JL, HP), pp. 581–595.
ICLP-1991-Dung #abduction: Negations as Hypotheses: An Abductive Foundation for Logic Programming (PMD), pp. 3–17.
ICLP-1991-Ferrand #concept #prolog: Basic Concepts of Logic Programming and Prolog (GF), p. 942.
ICLP-1991-GabbrielliL #constraints #modelling #source code: Modeling Answer Constraints in Constraint Logic Programs (MG, GL), pp. 238–252.
ICLP-1991-Haridi #parallel #principle: Parallel Logic Programming based on the Andorra Principle (SH), p. 943.
ICLP-1991-Harland #source code: A Clausal Form for the Completion of Logic Programs (JH), pp. 711–725.
ICLP-1991-HentenryckD #constraints #logic: The Cardinality Operator: A New Logical Connective for Constraint Logic Programming (PVH, YD), pp. 745–759.
ICLP-1991-HuY #semantics #source code: Extended Well-Founded Model Semantics for General Logic Programs (YH, LYY), pp. 412–425.
ICLP-1991-Inoue #source code: Extended Logic Programs with Default Assumptions (KI), pp. 490–504.
ICLP-1991-JayaramanN #implementation: Implementation Techniques for Scoping Constructs in Logic Programming (BJ, GN), pp. 871–886.
ICLP-1991-KorslootT #compilation #concurrent #programming language: Compilation Techniques for Nondeterminate Flat Concurrent Logic Programming Languages (MK, ET), pp. 457–471.
ICLP-1991-Kowalski #source code: Legislation as Logic Programs (RAK), p. 910.
ICLP-1991-Levi #on the #semantics #source code: On the Semantics of Logic Programs (GL), p. 945.
ICLP-1991-Marre #algebra #automation #specification #testing #towards #using: Toward Automatic Test Data Set Selection Using Algebraic Specifications and Logic Programming (BM), pp. 202–219.
ICLP-1991-Miller #unification: Unification of Simply Typed Lamda-Terms as Logic Programming (DM), pp. 255–269.
ICLP-1991-Miller91a #logic #tutorial: Logics for Logic Programming: A Tutorial (DM), p. 911.
ICLP-1991-MontanariR #constraints: Perfect Relaxation in Constraint Logic Programming (UM, FR), pp. 223–237.
ICLP-1991-MoscowitzS #source code: Lexical Logic Programs (YM, EYS), pp. 349–363.
ICLP-1991-PierroMP: Negation as Instantitation: A New Rule for the Treatment of Negation in Logic Programming (ADP, MM, CP), pp. 32–45.
ICLP-1991-Porto: Logic Programming Environments (AP), p. 946.
ICLP-1991-Przymusinski #source code: Well-Founded Completions of Logic Programs (TCP), pp. 726–741.
ICLP-1991-Robinet: Logic Programming at IBM: From the Lab to the Customer (BR), pp. 912–921.
ICLP-1991-Saint-Dizier: Logic Programming for Language Processing (PSD), p. 947.
ICLP-1991-Sato #first-order: Full First Order Logic Programming and Truth Predicate (TS), p. 948.
ICLP-1991-Turi #source code: Extending S-Models to Logic Programs with Negation (DT), pp. 397–411.
ICLP-1991-VerschaetseS #proving #source code #termination #using: Deriving Termination Proofs for Logic Programs, Using Abstract Procedures (KV, DDS), pp. 301–315.
ICLP-1991-YardeniFS #source code: Polymorphically Typed Logic Programs (EY, TWF, EYS), pp. 379–393.
ISLP-1991-BruynoogheSM #deduction #infinity #source code: A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs (MB, DDS, BM), pp. 117–131.
ISLP-1991-Brzoska #constraints: Temporal Logic Programming and its Relation to Constraint Logic Programming (CB), pp. 661–677.
ISLP-1991-DietzenP #declarative: A Declarative Alternative to “Assert” in Logic Programming (SD, FP), pp. 372–386.
ISLP-1991-GiordanoM #re-engineering: A Modal Reconstruction of Blocks and Modules in Logic Programming (LG, AM), pp. 239–253.
ISLP-1991-HarlandP #linear: The Uniform Proof-Theoretic Foundation of Linear Logic Programming (JH, DJP), pp. 304–318.
ISLP-1991-KakasM #source code: Stable Theories for Logic Programs (ACK, PM), pp. 85–100.
ISLP-1991-Kawamura #performance #source code: Derivation of Efficient Logic Programs by Synthesizing New Predicates (TK), pp. 611–625.
ISLP-1991-KempS #semantics #source code: Semantics of Logic Programs with Aggregates (DBK, PJS), pp. 387–401.
ISLP-1991-Millroth #compilation #source code: Reforming Compilation of Logic Programs (HM), pp. 485–499.
ISLP-1991-MozeticH #constraints #modelling: Integrating Numerical and Qualitative Models within Constraint Logic Programming (IM, CH), pp. 678–693.
ISLP-1991-Przymusinski #reasoning: Non-Monotonic Reasoning and Logic Programming (TCP), pp. 735–736.
ISLP-1991-ReedLS #source code: An Alternative Characterization of Disjunctive Logic Programs (DWR, DWL, BTS), pp. 54–68.
ISLP-1991-Sagiv #source code #termination: A Termination Test for Logic Programs (YS), pp. 518–532.
ISLP-1991-Wadge #higher-order: Higher-Order Horn Logic Programming (WWW), pp. 289–303.
LICS-1991-FruhwirthSVY #source code: Logic Programs as Types for Logic Programs (TWF, EYS, MYV, EY), pp. 300–309.
LICS-1991-HodasM #linear: Logic Programming in a Fragment of Intuitionistic Linear Logic (JSH, DM), pp. 32–42.
LICS-1991-KiferW #first-order #morphism #polymorphism: A First-Order Theory of Types and Polymorphism in Logic Programming (MK, JW), pp. 310–321.
LICS-1991-Stuckey #constraints: Constructive Negation for Constraint Logic Programming (PJS), pp. 328–339.
PODS-1990-Gelder #constraints #source code: Deriving Constraints Among Argument Sizes in Logic Programs (AVG), pp. 47–60.
PODS-1990-SaccaZ #modelling #nondeterminism #source code: Stable Models and Non-Determinism in Logic Programs with Negation (DS, CZ), pp. 205–217.
PODS-1990-Schlipf #semantics: The Expressive Powers of the Logic Programming Semantics (JSS), pp. 196–204.
PODS-1990-YouY #formal method #question: Three-Valued Formalization of Logic Programming: Is It Needed? (JHY, LYY), pp. 172–182.
SIGMOD-1990-LaenensSV: Extending Logic Programming (EL, DS, DV), pp. 184–193.
SIGMOD-1990-Saraiya #problem #source code: Hard Problems for Simple Logic Programs (YPS), pp. 64–73.
VLDB-1990-RamakrishnanSS #bottom-up #evaluation #fixpoint #source code: Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs (RR, DS, SS), pp. 359–371.
VDME-1990-KatoKNST: Modal Logic Programming (DK, TK, RN, JS, HT), pp. 29–40.
GG-1990-CorradiniMREL #graph grammar: Graph Grammars and Logic Programming (AC, UM, FR, HE, ML), pp. 221–237.
SEKE-1990-Iyengar #execution #source code: Intelligent Forward Execution in Logic Programs (SRI), pp. 153–158.
ALP-1990-DebartEL #equation #multi #order #using: Multi-Modal Logic Programming using Equational and Order-Sorted Logic (FD, PE, ML), pp. 55–69.
ALP-1990-Dung #on the #source code: On the strong completion of logic programs (PMD), pp. 158–172.
ALP-1990-GabbrielliL #concurrent #constraints #fixpoint #semantics #source code: Unfolding and Fixpoint Semantics of Concurrent Constraint Logic Programs (MG, GL), pp. 204–216.
ALP-1990-Hanus #equation #source code #specification: Logic Programs with Equational Type Specifications (MH), pp. 70–85.
ALP-1990-KanchanasutS #source code: Eliminating Negation from Normal Logic Programs (KK, PJS), pp. 217–231.
ALP-1990-Saint-Dizier #dependence #on the: On Logic Programming Interpretations of Dislog: Programming Long-Distance Dependencies in Logic (PSD), pp. 232–246.
PLDI-1990-DebrayLH #analysis #source code: Task Granularity Analysis in Logic Programs (SKD, NWL, MVH), pp. 174–188.
PLDI-1990-Jacobs #constraints #type system: Type Declarations as Subtype Constraints in Logic Programming (DJ), pp. 165–173.
PLILP-1990-BrogiMPT #framework #functional: Logic Programming within a Functional Framework (AB, PM, DP, FT), pp. 372–386.
PLILP-1990-Hanus #compilation #similarity #source code: Compiling Logic Programs with Equality (MH), pp. 387–400.
PLILP-1990-LimS #constraints: A Constraint Logic Programming Shell (PL, PJS), pp. 75–88.
PLILP-1990-Nilsson #approximate #semantics #source code: Systematic Semantic Approximations of Logic Programs (UN), pp. 293–306.
PLILP-1990-TarauB #source code: Elementary Logic Programs (PT, MB), pp. 159–173.
PLILP-1990-WangS #source code #termination #towards: Towards a Characterization of Termination of Logic Programs (BW, RKS), pp. 204–221.
POPL-1990-HeintzeJ #approximate #finite #source code #theorem: A Finite Presentation Theorem for Approximating Logic Programs (NH, JJ), pp. 197–209.
POPL-1990-Ramakrishnan #parallel #source code: Parallelism in Logic Programs (RR), pp. 246–260.
CC-1990-BeneyB #compilation #named: STARLET: An Affix-Based Compiler Compiler Designed as a Logic Programming System (JB, JFB), pp. 71–85.
PPoPP-1990-TickI #parallel #programming language: Programming Techniques for Efficiently Exploiting Parallelism in Logic Programming Languages (ET, NI), pp. 31–39.
ESOP-1990-ProiettiP #source code #synthesis: Synthesis of Eureka Predicates for Developing Logic Programs (MP, AP), pp. 306–325.
ESOP-1990-SchreyePRB #constraints #implementation #prolog: Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism (DDS, DP, JR, MB), pp. 106–117.
CADE-1990-BaralLM #semantics #source code: Generalized Well-founded Semantics for Logic Programs (CB, JL, JM), pp. 102–116.
CADE-1990-FeltyM #encoding #programming language #λ-calculus: Encoding a Dependent-Type Lambda-Calculus in a Logic Programming Language (APF, DM), pp. 221–235.
CLP-1990-Beeri90 #database: Logic Programming and Databases (CB), p. 783.
CLP-1990-Fages90 #fixpoint #semantics #source code: A New Fixpoint Semantics for General Logic Programs Compared with the Well-Founded and the Stable Model Semantics (FF), pp. 441–458.
CLP-1990-Fribourg90 #execution #induction #prolog #proving #source code: Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction (LF), pp. 685–699.
CLP-1990-Gaifman90 #semantics #source code: Semantics of Logic Programs (HG), pp. 779–782.
CLP-1990-GelfondL90 #source code: Logic Programs with Classical Negation (MG, VL), pp. 579–597.
CLP-1990-GiacobazziR90 #optimisation #pipes and filters #source code: Pipeline Optimizations in AND-Parallel Logic Programs (RG, LR), pp. 291–305.
CLP-1990-Hentenryck90 #constraints #incremental: Incremental Constraint Satisfaction in Logic Programming (PVH), pp. 189–202.
CLP-1990-HodasM90 #representation: Representing Objects in a Logic Programming Langueage with Scoping Constructs (JSH, DM), pp. 511–526.
CLP-1990-JacobsLW90 #multi #runtime #source code: Multiple Specialization of Logic Programs with Run-Time Test (DJ, AL, WHW), pp. 717–731.
CLP-1990-Kergommeaux90 #parallel: Parallel Logic Programming Systems (JCdK), p. 785.
CLP-1990-KowalskiS90 #exception #source code: Logic Programs with Exceptions (RAK, FS), pp. 598–613.
CLP-1990-MeyerC90 #architecture #source code: Architected Failure Handling for AND-Parallel Logic Programs (DMM, JSC), pp. 271–290.
CLP-1990-Miller90 #higher-order: Higher-Order Logic Programming (DM), p. 784.
CLP-1990-MonteiroP90 #inheritance: A Transformational View of Inheritance in Logic Programming (LM, AP), pp. 481–494.
CLP-1990-MuthukumarH90 #automation #definite clause grammar #independence #parallel #source code: The DCG, UDG, and MEL Methods for Automatic Compile-time Parallelization of Logic Programs for Independent And-parallelism (KM, MVH), pp. 221–236.
CLP-1990-NishidaKMG90 #architecture #evaluation #garbage collection #parallel: Evaluation of MRB Garbage Collection on Parallel Logic Programming Architectures (KN, YK, AM, AG), pp. 83–95.
CLP-1990-Pfenning90: Types in Logic Programming (FP), p. 786.
CLP-1990-Plumer90 #proving #source code #termination: Termination Proofs for Logic Programs Based on Predicate Inequalities (LP), pp. 634–648.
CLP-1990-PowerS90 #source code: A Notion of Map between Logic Programs (AJP, LS), pp. 390–404.
CLP-1990-SawamuraMYO90 #approach #logic #proving #specification: A Logic Programming Approach to Specifying Logics and Constructing Proofs (HS, TM, KY, KO), pp. 405–424.
CLP-1990-Sheng90 #higher-order #relational: HIFUNLOG : Logic Programming with Higher-order Relational Functions (YHS), pp. 529–545.
CLP-1990-Vardi90 #database #optimisation #problem #source code: Global Optimization Problems for Database Logic Programs (MYV), pp. 767–771.
CSL-1990-Burgard #performance #source code: Efficiency Considerations on Goal-Directed Chaining for Logic Programs (WB), pp. 80–94.
LICS-1990-Cerrito #linear #semantics #source code: A Linear Semantics for Allowed Logic Programs (SC), pp. 219–227.
NACLP-1990-BenkerimiL #partial evaluation #source code: A Partial Evaluation Procedure for Logic Programs (KB, JWL), pp. 343–358.
NACLP-1990-BoerP #comparison #concurrent: Concurrent Logic Programming: Asynchronism and Language Comparison (FSdB, CP), pp. 175–194.
NACLP-1990-BonnerM: Adding Negation-as-Failure to Intuitionistic Logic Programming (AJB, LTM), pp. 681–703.
NACLP-1990-CorradiniM #algebra #semantics #source code: An Algebraic Semantics of Logic Programs as Structured Transition Systems (AC, UM), pp. 788–812.
NACLP-1990-CoxMT #complexity #constraints #programming language: Computational Complexity and Constraint Logic Programming Languages (JC, KM, CT), pp. 401–415.
NACLP-1990-GrecoS #source code: Negative Logic Programs (SG, DS), pp. 480–497.
NACLP-1990-GuptaJ90a #execution #modelling #on the #source code: On Criteria for Or-Parallel Execution Models of Logic Programs (GG, BJ), pp. 737–756.
NACLP-1990-Hentenryck #constraints: Constraint Logic Programming: From Theory to Applications (PVH), p. 841.
NACLP-1990-JacquetM #comparative #parallel #programming language #semantics: Comparative Semantics for a Parallel Contextual Logic Programming Language (JMJ, LM), pp. 195–214.
NACLP-1990-JourdanV #constraints #reasoning: Constraint Logic Programming Applied to Hypothetical Reasoning in Chemistry (JJ, REVP), pp. 154–172.
NACLP-1990-Lobo #on the #source code: On Constructive Negation for Disjunctive Logic Programs (JL), pp. 704–718.
NACLP-1990-MancarellaPRT #algebra #source code: Algebraic Properties of a Class of Logic Programs (PM, DP, MR, MT), pp. 23–39.
NACLP-1990-MarriottS #analysis #constraints #source code: Analysis of Constraint Logic Programs (KM, HS), pp. 531–547.
NACLP-1990-MarriottSD #source code: A Characterization of Non-Floundering Logic Programs (KM, HS, PWD), pp. 661–680.
NACLP-1990-OhwadaM #approach #consistency #constraints #design #interface #maintenance: A Constraint Logic Programming Approach for Maintaining Consistency in User-Interface Design (HO, FM), pp. 139–153.
NACLP-1990-Przymusinski #database #deduction #semantics #source code: Stationary Semantics for Disjunctive Logic Programs and Deductive Databases (TCP), pp. 40–59.
NACLP-1990-Reddy #source code: Types for Logic Programs (USR), pp. 836–840.
PODS-1989-Bry #database #formal method: Logic Programming as Constructivism: A Formalization and its Application to Databases (FB), pp. 34–50.
PODS-1989-Gelder #fixpoint #source code: The Alternating Fixpoint of Logic Programs with Negation (AVG), pp. 1–10.
PODS-1989-KiferW #object-oriented: A Logic for Object-Oriented Logic Programming (Maier’s O-Logic Revisited) (MK, JW), pp. 379–393.
PODS-1989-Przymusinski #fixpoint: Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model (TCP), pp. 11–21.
PODS-1989-Ross #semantics #source code: A Procedural Semantics for Well Founded Negation in Logic Programs (KAR), pp. 22–33.
FPCA-1989-SilbermannJ #abstraction #functional #set: Set Abstraction in Functional and Logic Programming (FSKS, BJ), pp. 313–326.
CHI-1989-SpenkeB #interface #spreadsheet: A spreadsheet interface for logic programming (MS, CB), pp. 75–80.
KR-1989-Przymusinski #formal method #reasoning: Three-Valued Formalizations of Non-Monotonic Reasoning and Logic Programming (TCP), pp. 341–348.
POPL-1989-Baudinet: Temporal Logic Programming is Complete and Expressive (MB), pp. 267–280.
POPL-1989-GaifmanS #composition #semantics #source code: Fully Abstract Compositional Semantics for Logic Programs (HG, EYS), pp. 134–142.
POPL-1989-YelickZ #type system: Moded Type Systems for Logic Programming (KAY, JLZ), pp. 116–124.
CAAP-1989-Deransart #declarative #proving #source code: Proofs of Declarative Properties of Logic Programs (PD), pp. 207–226.
CCIPL-1989-BossiC #correctness #source code #verification: Verifying Correctness of Logic Programs (AB, NC), pp. 96–110.
CSL-1989-Stark89a #quantifier #source code: A Quantifier-Free Completion of Logic Programs (RFS), pp. 384–395.
CSL-1989-StepankovaS #source code: Stratification of Definite Clause Programs and of General Logic Programs (OS, PS), pp. 396–408.
LICS-1989-GaifmanS #proving #semantics #source code: Proof Theory and Semantics of Logic Programs (HG, EYS), pp. 50–62.
NACLP-1989-Bezem #source code #termination: Characterizing Termination of Logic Programs with Level Mappings (MB), pp. 69–80.
NACLP-1989-CasanovaGS #source code: Computing Answers to Logic Programs with Weak Model Elimination (MAC, RAdTG, AS), pp. 92–114.
NACLP-1989-ChenKW #first-order #higher-order #named #semantics: HiLog: A First-Order Semantics for Higher-Order Logic Programming Constructs (WC, MK, DSW), pp. 1090–1114.
NACLP-1989-DevilleB #source code #towards: Generalization and Program Schemata: A Step Towards Computer-Aided Construction of Logic Programs (YD, JB), pp. 409–425.
NACLP-1989-DungK89a #approach #declarative #fixpoint #semantics #source code: A Fixpoint Approach to Declarative Semantics of Logic Programs (PMD, KK), pp. 604–625.
NACLP-1989-Elcock #named: Absys: The Historical Inevitability of Logic Programming (EWE), pp. 1201–1214.
NACLP-1989-GaifmanMS #behaviour #concurrent #constraints #semantics #source code: Reactive Behaviour Semantics for Concurrent Constraint Logic Programs (HG, MJM, EYS), pp. 553–569.
NACLP-1989-HermenegildoR #correctness #independence #on the #performance #source code: On the Correctness and Efficiency of Independent And-Parallelism in Logic Programs (MVH, FR), pp. 369–389.
NACLP-1989-JacobsL #alias #approximate #performance #source code: Accurate and Efficient Approximation of Variable Aliasing in Logic Programs (DJ, AL), pp. 154–165.
NACLP-1989-KahnK #concurrent: Money as a Concurrent Logic Program (KMK, WAK), pp. 513–535.
NACLP-1989-KiferS #on the #power of #source code: On the Expressive Power of Annotated Logic Programs (MK, VSS), pp. 1069–1089.
NACLP-1989-MaherR #fixpoint #source code: Déjà Vu in Fixpoints of Logic Programs (MJM, RR), pp. 963–980.
NACLP-1989-MaherS #constraints #programming language #query: Expanding Query Power in Constraint Logic Programming Languages (MJM, PJS), pp. 20–36.
NACLP-1989-MarekT #semantics #source code: Stable Semantics for Logic Programs and Default Theories (VWM, MT), pp. 243–256.
NACLP-1989-MelloNR #perspective #re-engineering: Logic Programming in a Software Engineering Perspective (PM, AN, CR), pp. 441–458.
NACLP-1989-Minker #towards: Toward A Foundation of Disjunctive Logic Programming (JM), pp. 1215–1235.
NACLP-1989-Przymusinski #on the: On Constructive Negation in Logic Programming (TCP).
NACLP-1989-PyoR #polymorphism #source code: Inference of Polymorphic Types for Logic Programs (CP, USR), pp. 1115–1132.
NACLP-1989-SaletoreK #execution #parallel #performance #source code: Obtaining First Solutions Faster in AND-OR Parallel Execution of Logic Programs (VAS, LVK), pp. 390–406.
NACLP-1989-SataluriF #semantics #source code #specification #using: Semantic Specification Using Logic Programs (SRS, ACF), pp. 772–791.
NACLP-1989-WilsonB #comparison #constraints: Extending Hierarchical Constraint Logic Programming: Nonmonotonicity and Inter-Hierarchy Comparison (MW, AB), pp. 3–19.
NACLP-1989-YouL: Supported Circumscription and Its Relation to Logic Programming with Negation (JHY, LL), pp. 291–309.
PODS-1988-GelderRS #semantics #set #source code: Unfounded Sets and Well-Founded Semantics for General Logic Programs (AVG, KAR, JSS), pp. 221–230.
PODS-1988-ImielinskiN #algebra #source code: Explicit Control of Logic Programs Through Rule Algebra (TI, SAN), pp. 103–116.
PODS-1988-Kuper #on the #power of #programming language #set: On the Expressive Power of Logic Programming Languages with Sets (GMK), pp. 10–14.
PODS-1988-NaqviK #database: Database Updates in Logic Programming (SAN, RK), pp. 251–262.
SIGMOD-1988-Vardi #database #deduction: Database Logic Programming, Deductive Databases, and Expert Database Systems (MYV), p. 7.
SIGMOD-1988-WolfsonS #distributed #source code: Distributed Processing of Logic Programs (OW, AS), pp. 329–336.
ICALP-1988-Weijland #semantics #source code: Semantics for Logic Programs without Occur Check (WPW), pp. 710–726.
ALP-1988-BeierleP #data type #equation #specification: Integrating Logic Programming and Equational Specification of Abstract Data Types (CB, UP), pp. 71–82.
ALP-1988-Dayantis #abstraction #composition: Types, Modularisation and Abstraction in Logic Programming (GD), pp. 127–136.
ALP-1988-Moreno-NavarroR #functional #named #programming language: BABEL: A Functional and Logic Programming Language based on Constructor Discipline and Narrowing (JJMN, MRA), pp. 223–232.
ALP-1988-Smolka #order: Logic Programming with Polymorphically Order-Sorted Types (GS), pp. 53–70.
PLDI-1988-Debray #optimisation #source code: Unfold/Fold Transformations and Loop Optimization of Logic Programs (SKD), pp. 297–307.
PLILP-1988-BarbutiM #source code: A Tool to Check the Non-Floundering Logic Programs and Goals (RB, MM), pp. 58–67.
PLILP-1988-BonnierM #source code #towards: Towards a Clean Amalgamation of Logic Programs with External Procedures (SB, JM), pp. 20–34.
PLILP-1988-DeransartM: A Grammatical View of Logic Programming (PD, JM), pp. 219–251.
PLILP-1988-Nilsson #abstract interpretation #framework #source code #towards: Towards a Framework for the Abstract Interpretation of Logic Programs (UN), pp. 68–82.
PLILP-1988-RiedewaldL #attribute grammar #using: Using an Attribute Grammar as a Logic Program (GR, UL), pp. 161–179.
POPL-1988-Debray #analysis #data flow #performance #source code: Efficient Dataflow Analysis of Logic Programs (SKD), pp. 260–273.
ESOP-1988-JacobsL #compilation #source code #strict: Compilation of Logic Programs for Restricted And-Parallelism (DJ, AL), pp. 284–297.
ESOP-1988-WeemeeuwBH #architecture #data flow #implementation #on the #programming language: On Implementing Logic Programming Languages on a Dataflow Architecture (PW, MB, MDH), pp. 359–372.
STOC-1988-CosmadakisGKV #database #decidability #optimisation #problem #source code: Decidable Optimization Problems for Database Logic Programs (SSC, HG, PCK, MYV), pp. 477–490.
CADE-1988-FeltyGHMNS #named #programming language #prolog #λ-calculus: Lambda-Prolog: An Extended Logic Programming Language (APF, ELG, JH, DM, GN, AS), pp. 754–755.
CADE-1988-FeltyM #higher-order #programming language #proving #specification #theorem proving: Specifying Theorem Provers in a Higher-Order Logic Programming Language (APF, DM), pp. 61–80.
CADE-1988-MinkerR #source code: Procedural Interpretation of Non-Horn Logic Programs (JM, AR), pp. 278–293.
CADE-1988-Subrahmanian #query: Query Processing in Quantitative Logic Programming (VSS), pp. 81–100.
CSL-1988-OchozkaSS #complexity #normalisation #source code: Normal Forms and the Complexity of Computations of Logic Programs (VO, OS, PS), pp. 357–371.
JICSCP-1988-BatarekhS88 #semantics #source code: Semantical Equivalences of (Non-Classical) Logic Programs (AB, VSS), pp. 960–977.
JICSCP-1988-BiswasSY88 #automaton #parallel #scalability #source code #strict: A Scalable Abstract Machine Model to Support Limited-OR (LOR) / Restricted-AND Parallelism (RAP) in Logic Programs (PB, SCS, DYYY), pp. 1160–1179.
JICSCP-1988-BonnierM88 #source code #towards: Towards a Clean Amalgamation of Logic Programs with External Procedures (SB, JM), pp. 311–326.
JICSCP-1988-Bundy88: A Broader Interpretation of Logic in Logic Programming (AB), pp. 1624–1648.
JICSCP-1988-CosciaFLST88 #compilation: Meta-Level Definition and Compilation of Inference Engines in the Epsilon Logic Programming Environment (PC, PF, GL, GS, LT), pp. 359–373.
JICSCP-1988-Dahl88 #representation: Representing Linguistic Knowledge through Logic Programming (VD), pp. 249–262.
JICSCP-1988-Debray88 #parallel #source code #static analysis: Static Analysis of Parallel Logic Programs (SKD), pp. 711–732.
JICSCP-1988-DincbasSH88 #constraints #problem: Solving a Cutting-Stock Problem in Constraint Logic Programming (MD, HS, PVH), pp. 42–58.
JICSCP-1988-ElkanM88 #automation #induction #reasoning #source code: Automated Inductive Reasoning about Logic Programs (CE, DAM), pp. 876–892.
JICSCP-1988-FittingB88 #semantics: Stratified and Three-valued Logic Programming Semantics (MF, MBJ), pp. 1054–1069.
JICSCP-1988-GelfondL88 #semantics: The Stable Model Semantics for Logic Programming (MG, VL), pp. 1070–1080.
JICSCP-1988-GorlickK88 #analysis #named #performance #source code: Gauge: A Workbench for the Performance Analysis of Logic Programs (MMG, CK), pp. 548–561.
JICSCP-1988-JayaramanN88 #implementation: Subset-Logic Programming: Application and Implementation (BJ, AN), pp. 843–858.
JICSCP-1988-KaleRS88 #execution #independence #memory management #parallel #source code: A Memory Organization Independent Binding Environment for AND and OR Parallel Execution of Logic Programs (LVK, RR, WWS), pp. 1223–1240.
JICSCP-1988-Kaplan88 #algorithm #complexity #source code: Algorithmic Complexity of Logic Programs (SK), pp. 780–793.
JICSCP-1988-KwokS88 #source code: Implicit Definition of Logic Programs (CSK, MJS), pp. 374–385.
JICSCP-1988-LinK88 #execution #memory management #multi #source code #summary: AND-Parallel Execution of Logic Programs on a Shared Memory Multiprocessor: A Summary of Results (YJL, VK), pp. 1123–1141.
JICSCP-1988-MancarellaP88 #algebra #source code: An Algebra of Logic Programs (PM, DP), pp. 1006–1023.
JICSCP-1988-MarriottNL88 #source code: Most Specific Logic Programs (KM, LN, JLL), pp. 909–923.
JICSCP-1988-MarriottS88 #abstract interpretation #bottom-up #source code: Bottom-up Abstract Interpretation of Logic Programs (KM, HS), pp. 733–748.
JICSCP-1988-NgL88 #contest #execution #parallel #source code: The Competition Model for Parallel Execution of Logic Programs (KWN, HfL), pp. 1180–1187.
JICSCP-1988-ParkerM88 #formal method #source code: A Theory of Directed Logic Programs and Streams (DSPJ, RRM), pp. 620–650.
JICSCP-1988-PrzymusinskaP88 #semantics #source code: Weakly Perfect Model Semantics for Logic Programs (HP, TCP), pp. 1106–1120.
JICSCP-1988-RaatzG88 #relational #semantics: A Relational Semantics for Logic Programming (SR, JHG), pp. 1024–1035.
JICSCP-1988-Ramakrishnan88 #approach #source code: Magic Templates: A Spellbinding Approach to Logic Programs (RR), pp. 140–159.
JICSCP-1988-Shankar88 #architecture #memory management #unification: A Hierarchical Associative Memory Architecture for Logic Programming Unification (SS), pp. 1428–1447.
JICSCP-1988-TsengB88 #data-driven #execution #parallel #source code: A Data-Driven Parallel Execution Model for Logic Programs (CCT, PB), pp. 1204–1222.
JICSCP-1988-WarrenHD88 #analysis #on the #source code: On the Practicality of Global Flow Analysis of Logic Programs (RW, MVH, SKD), pp. 684–699.
JICSCP-1988-Zachary88 #approach #equation: A Pragmatic Approach to Equational Logic Programming (JLZ), pp. 295–310.
PODS-1987-BeeriKBR #bound #source code: Bounds on the Propagation of Selection into Logic Programs (CB, PCK, FB, RR), pp. 214–226.
PODS-1987-Kuper #set: Logic Programming With Sets (GMK), pp. 11–20.
ICALP-1987-Abdallah: Logic Programming with Ions (MANA), pp. 11–20.
RTA-1987-ODonnell #equation #implementation: Term-Rewriting Implementation of Equational Logic Programming (MJO), pp. 1–12.
POPL-1987-JaffarL #constraints: Constraint Logic Programming (JJ, JLL), pp. 111–119.
POPL-1987-Saraswat #concurrent #programming language #semantics: The Concurrent Logic Programming Language CP: Definition and Operational Semantics (VAS), pp. 49–62.
ESEC-1987-GarzottoGMM #on the #realtime #specification #using: On the Specification of Real-Time Systems Using Logic Programming (FG, CG, DM, AM), pp. 180–190.
AF-1987-ClarkF #concurrent #declarative: A Declarative Environment for Concurrent Logic Programming (KLC, ITF), pp. 212–242.
CFLP-1987-BarbutiMPT #implementation #source code: Intensional Negation of Logic Programs: Examples and Implementation Techniques (RB, PM, DP, FT), pp. 96–110.
CFLP-1987-Bellia #functional #named #paradigm: Retractions: A Functional Paradigm for Logic Programming (MB), pp. 260–275.
CFLP-1987-DrabentM #induction #source code: Inductive Assertion Method for Logic Programs (WD, JM), pp. 167–181.
CSL-1987-StepankovaS #normalisation #source code: Developing Logic Programs: Computing Through Normalizing (OS, PS), pp. 304–321.
ICLP-1987-BarklundM87: Hash Tables in Logic Programming (JB, HM), pp. 411–427.
ICLP-1987-CecchiSA87 #source code: Evaluating Logic Programs via Set-Valued Functions (CC, DS, LCA), pp. 428–455.
ICLP-1987-DiszLO87 #source code: Experiments with OR-Parallel Logic Programs (TD, ELL, RAO), pp. 576–600.
ICLP-1987-Ebcioglu87 #music #performance #programming language: An Efficient Logic Programming Language and Its Application to Music (KE), pp. 513–532.
ICLP-1987-Gallaire87: Boosting Logic Programming (HG), pp. 962–988.
ICLP-1987-Helm87 #deduction #induction #source code: Inductive and Deductive Control of Logic Programs (RH), pp. 488–512.
ICLP-1987-HentenryckD87: Forward Checking in Logic Programming (PVH, MD), pp. 229–256.
ICLP-1987-Hermenegildo87 #execution #memory management #precedence #source code: Relating Goal-Scheduling, Precedence, and Memory Management in AND-Parallel Execution of Logic Programs (MVH), pp. 556–575.
ICLP-1987-Kale87 #evaluation #parallel #process #source code: The REDUCE-OR Process Model for Parallel Evaluation of Logic Programs (LVK), pp. 616–632.
ICLP-1987-KanamoriH87 #source code: Construction of Logic Programs Based on Generalized Unfold/Fold Rules (TK, KH), pp. 744–768.
ICLP-1987-MorishitaNH87: Symbolical Construction of Truth Value Domain for Logic Program (SM, MN, SH), pp. 533–555.
ICLP-1987-OhkiTF87 #object-oriented #parallel #programming language: An Object-Oriented Programming Language Based on the Parallel Logic Programming Language KL1 (MO, AT, KF), pp. 894–909.
ICLP-1987-Somogyi87 #modelling #precise #source code: A System of Precise Models for Logic Programs (ZS), pp. 769–787.
ICLP-1987-TinkerL87 #design: A Performance-Oriented Design for OR-Parallel Logic Programming (PT, GL), pp. 601–615.
LICS-1987-BidoitF: Minimalism subsumes Default Logic and Circumscription in Stratified Logic Programming (NB, CF), pp. 89–97.
LICS-1987-GaifmanMSV #database #decidability #optimisation #problem #source code: Undecidable Optimization Problems for Database Logic Programs (HG, HGM, YS, MYV), pp. 106–115.
SLP-1987-AbadiM87: Temporal Logic Programming (MA, ZM), pp. 4–16.
SLP-1987-Blair87: Canoncical Conservative Extensions of Logic Program Completions (HAB), pp. 154–161.
SLP-1987-Conery87 #memory management #parallel #source code: Binding Environments for Parallel Logic Programs in Non-Shared Memory Multiprocessors (JSC), pp. 457–467.
SLP-1987-Debray87 #analysis #source code: Flow Analysis of a Simple Class of Dynamic Logic Programs (SKD), pp. 307–316.
SLP-1987-Dietrich87: Extension Tables: Memo Relations in Logic Programming (SWD), pp. 264–272.
SLP-1987-DiszL87 #behaviour #parallel #source code #visual notation: A Graphical Tool for Observing the Behavior of Parallel Logic Programs (TD, ELL), pp. 46–53.
SLP-1987-Drabent87 #question #source code: Do Logic Programs Resemble Programs in Conventional Languages? (WD), pp. 289–396.
SLP-1987-Holldobler87 #equation: Equational Logic Programming (SH), pp. 335–346.
SLP-1987-Kale87 #parallel: “Completeness” and “Full Parallelism” of Parallel Logic Programming Schemes (LVK), pp. 125–133.
SLP-1987-MillerN87 #approach #source code: A Logic Programming Approach to Manipulating Formulas and Programs (DM, GN), pp. 379–388.
SLP-1987-OhwadaM87 #parallel #simulation: Qualitative Simulation in Parallel Logic Programming (HO, FM), pp. 480–489.
SLP-1987-SekiF87 #source code: Notes on Transformation Techniques for Generate and Test Logic Programs (HS, KF), pp. 215–223.
SLP-1987-Subrahmanian87 #on the #semantics #source code: On the Semantics of Quantitative Logic Programs (VSS), pp. 173–182.
SLP-1987-Wilson87 #case study #concurrent: Concurrent α-β: A Study in Concurrent Logic Programming (WGW), pp. 360–367.
PODS-1986-BancilhonMSU #set #source code: Magic Sets and Other Strange Ways to Implement Logic Programs (FB, DM, YS, JDU), pp. 1–15.
SIGMOD-1986-GardarinM #database #evaluation #recursion #source code: Evaluation of Database Recursive Logic Programs as Recurrent Function Series (GG, CdM), pp. 177–186.
LFP-1986-JayaramanS #equation #functional #reduction #semantics #set: Equations, Sets, and Reduction Semantics for Functional and Logic Programming (BJ, FSKS), pp. 320–331.
OOPSLA-1986-KahnTMB #concurrent #programming language: Objects in Concurrent Logic Programming Languages (KMK, EDT, MSM, DGB), pp. 242–257.
POPL-1986-YouS #equation: Equational Logic Programming: An Extension to Equational Programming (JHY, PAS), pp. 209–218.
ESOP-1986-CodognetCF #backtracking #source code: A Very Intelligent Backtracking Method for Logic Programs (CC, PC, GF), pp. 315–326.
ESOP-1986-SchwinnB #execution #source code: An And-Parallel Execution Model of Logic Programs (BS, GB), pp. 289–300.
ESOP-1986-Sondergaard #abstract interpretation #reduction #source code: An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction (HS), pp. 327–338.
ICLP-1986-BarbutiM86 #source code: Completeness of the SLDNF-resolution for a class of logic programs (RB, MM), pp. 600–614.
ICLP-1986-Beckman86 #concurrent #programming language #semantics #towards: Towards a Formal Semantics for Concurrent Logic Programming Languages (LB), pp. 335–349.
ICLP-1986-ButlerLMO86 #parallel: Parallel Logic Programming for Numeric Applications (RB, ELL, WM, RAO), pp. 375–388.
ICLP-1986-ChengzhengY86 #execution #source code: The OR-Forest Description for the Execution of Logic Programs (CS, TY), pp. 710–717.
ICLP-1986-FuchiF86 #generative: The Role of Logic Programming in the Fifth Generation Computer Project (KF, KF), pp. 1–24.
ICLP-1986-FujitaKTM86 #compilation #named #programming language #prolog: Tokio: Logic Programming Language Based on Temporal Logic and its Compilation to Prolog (MF, SK, HT, TMO), pp. 695–709.
ICLP-1986-Hermenegildo86 #automaton #execution #source code #strict: An Abstract Machine for Restricted AND-Parallel Execution of Logic Programs (MVH), pp. 25–39.
ICLP-1986-JaffarLM86 #roadmap #semantics: Invited Talk: Some Issues and Trends in the Semantics of Logic Programming (JJ, JLL, MJM), pp. 223–241.
ICLP-1986-JaffarS86 #equation #semantics: Logic Program Semantics for Programming with Equations (JJ, PJS), pp. 313–326.
ICLP-1986-KawaiMKT86 #framework #induction: A Framework for ICAI Systems Based on Inductive Inference and Logic Programming (KK, RM, OK, JT), pp. 188–202.
ICLP-1986-LinKL86 #algorithm #backtracking #execution #parallel #source code: An Intelligent Backtracking Algorithm for Parallel Execution of Logic Programs (YJL, VK, CHCL), pp. 55–68.
ICLP-1986-Maher86 #source code: Eqivalences of Logic Programs (MJM), pp. 410–424.
ICLP-1986-MartelliR86 #on the #semantics: On the Semantics of Logic Programing Languages (AM, GR), pp. 327–334.
ICLP-1986-MillerN86 #higher-order: Higher-Order Logic Programming (DM, GN), pp. 448–462.
ICLP-1986-Nakamura86 #execution #functional: Control of Logic Program Execution Based on the Functional Relations (KN), pp. 505–512.
ICLP-1986-Pereira86 #debugging: Rational Debugging in Logic Programming (LMP), pp. 203–210.
ICLP-1986-StepanekS86 #source code: Logic Programs and Alternation (PS, OS), pp. 99–106.
ICLP-1986-TakeuchiF86 #parallel #programming language: Parallel Logic Programming Languages (AT, KF), pp. 242–254.
ICLP-1986-Voda86: Choices in, and Limitations of, Logic Programming (PJV), pp. 615–623.
LICS-1986-BeckmanGW #algebra #execution #parallel #source code: An Algebraic Model of Parallel Execution of Logic Programs (LB, RG, AW), pp. 50–57.
SLP-1986-ArmstrongEV86 #problem: The Phoning Philosopher’s Problem or Logic Programming for Telecommunications Applications (JLA, NAE, RV), pp. 28–33.
SLP-1986-BekkersCRU86 #garbage collection #implementation #memory management #named #programming language #realtime: MALI: A Memory with a Real-time Garbage Collector for Implementing Logic Programming Languages (YB, BC, OR, LU), pp. 258–264.
SLP-1986-CiepielewskiH86 #evaluation #execution #performance #source code: Performance Evaluation of a Storage Model for OR--Parallel Execution of Logic Programs (AC, BH), pp. 246–257.
SLP-1986-Gelder86 #source code #using: Negation as Failure Using Tight Derivations for General Logic Programs (AVG), pp. 127–138.
SLP-1986-LiM86 #execution #parallel: The Sync Model: A Parallel Execution Method for Logic Programming (PPL, AJM), pp. 223–234.
SLP-1986-Miller86 #formal method: A Theory of Modules for Logic Programming (DM), pp. 106–114.
SLP-1986-OhrstromA86: The Logic of Tensed Statements in English — An Application of Logic Programming (PØ, NA), pp. 12–19.
SLP-1986-Tarnlund86 #perspective: Logic Programming-From a Logic Point of View (SÅT), pp. 96–103.
SLP-1986-VasakP86 #source code: Characterisation of Terminating Logic Programs (TV, JP), pp. 140–147.
VLDB-1985-Mendelzon #dependence #functional #source code: Functional Dependencies in Logic Programs (AOM), pp. 324–330.
RTA-1985-RetyKKL #algorithm #named #unification: NARROWER: A New Algorithm for Unification and Its Application to Logic Programming (PR, CK, HK, PL), pp. 141–157.
SLP-1985-CoxP85 #deduction: Surface Deduction: A Uniform Mechanism for Logic Programming (PTC, TP), pp. 220–227.
SLP-1985-DembinskiM85 #backtracking #source code: AND-Parallelism with Intelligent Backtracking for Annotated Logic Programs (PD, JM), pp. 29–38.
SLP-1985-DershowitzP85: Logic Programming cum Applicative Programming (ND, DAP), pp. 54–66.
SLP-1985-Fribourg85 #interpreter #named #programming language: SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting (LF), pp. 172–184.
SLP-1985-Gallaire85: Logic Programming: Further Developments (HG), pp. 88–96.
SLP-1985-GallierR85 #graph grammar: Logic Programming and Graph Rewriting (JHG, SR), pp. 208–219.
SLP-1985-GanzingerH85 #compilation #composition: Modular Logic Programming of Compilers (HG, MH), pp. 242–253.
SLP-1985-Kowalski85: Directions for Logic Programming (RAK), pp. 2–7.
SLP-1985-MaluszynskiK85 #execution #source code: Unification-Free Execution of Logic Programs (JM, HJK), pp. 78–86.
SLP-1985-OKeefe85a #algebra #source code #towards: Towards an Algebra for Constructing Logic Programs (RAO), pp. 152–160.
ICALP-1984-Abdallah #infinity #on the: On the Interpretation of Infinite Computations in Logic Programming (MANA), pp. 358–370.
LFP-1984-Smolka #data flow #source code: Making Control and Data Flow in Logic Programs Explicit (GS), pp. 311–322.
POPL-1984-SubrahmanyamY #evaluation #functional #lazy evaluation #reduction #source code: Pattern Driven Lazy Reduction: A Unifying Evaluation Mechanism for Functional and Logic Programs (PAS, JHY), pp. 228–234.
DAC-1984-HorstmannS #design #using: Computer aided design (CAD) using logic programming (PWH, EPS), pp. 144–151.
ILPC-1984-DershowitzJ84: Logic Programming by Completion (ND, NAJ), pp. 313–320.
ILPC-1984-EriksonR84 #array: Incorporating Mutable Arrays into Logic Programming (LHE, MR), pp. 101–114.
ILPC-1984-GoguenM84 #similarity: Equality, Types, Modules and Generics for Logic Programming (JAG, JM), pp. 115–125.
ILPC-1984-Johansson84 #source code #symmetry #using: Using Symmetry for the Derivation of Logic Programs (ALJ), pp. 243–251.
ILPC-1984-Miklos84 #case study #comparison #programming language: A Comparison of two Logic Programming Languages: A Case Study (MS), pp. 41–51.
ILPC-1984-Nakamura84 #concurrent #evaluation #source code: Associative Concurrent Evaluation of Logic Programs (KN), pp. 321–331.
ILPC-1984-StepankovaS84 #source code: Computation Trees and Transformations of Logic Programs (OS, PS), pp. 53–63.
ILPC-1984-SunW84: A Model Theory of Logic Programming Methodology (HS, LW), pp. 253–262.
ILPC-1984-TamakiS84 #source code: Unfold/Fold Transformation of Logic Programs (HT, TS), pp. 127–138.
ILPC-1984-WolframML84 #source code: A Unified Treatment of Resolution Strategies for Logic Programs (DAW, MJM, JLL), pp. 263–276.
SLP-1984-BarbutiBLM84 #functional #integration #on the: On the Integration of Logic Programming and Functional Programming (RB, MB, GL, MM), pp. 160–166.
SLP-1984-GergelyS84: Cuttable Formulas for Logic Programming (TG, MS), pp. 299–310.
SLP-1984-Kahn84 #source code: A Primitive for the Control of Logic Programs (KMK), pp. 242–251.
SLP-1984-LindstromP84 #execution: Stream-Based Execution of Logic Programming (GL, PP), pp. 168–176.
SLP-1984-PortoF84 #approach #natural language #semantics: Natural Language Semantics: A Logic Programming Approach (AP, MF), pp. 228–232.
SLP-1984-Reddy84 #functional #source code: Transformation of Logic Programs into Functional Programs (USR), pp. 187–196.
SLP-1984-Smith84: Logic Programming on an FFP Machine (BS), pp. 177–186.
SLP-1984-SubrahmanyamY84 #concept #evaluation #functional: Conceptual Basis and Evaluation Strategies for Integrating Functional and Logic Programming (PAS, JHY), pp. 144–153.
SLP-1984-Tamaki84 #programming language #semantics: Semantics of a Logic Programming Language with a Reducibility Predicate (HT), pp. 259–264.
SLP-1984-TaylorLMS84 #parallel #using: Logic Programming Using Parallel Associative Operations (ST, AL, GQMJ, SJS), pp. 58–68.
ICALP-1983-SatoT #source code: Enumeration of Success Patterns in Logic Programs (TS, HT), pp. 640–652.
LFP-1982-EggertS #programming language: Logic Enhancement: A Metho for Extending Logic Programming Languages (PRE, DVS), pp. 74–80.
ILPC-1982-BarbutiDL82 #proving #source code #towards: Toward an Inductionless Technique for Proving Properties of Logic Programs (RB, PD, GL), pp. 175–181.
ILPC-1982-EisingerKM82 #approach #parallel: Logic Programming: A Parallel Approach (NE, SK, JM), pp. 71–77.
ILPC-1982-Kurokawa82 #re-engineering #what: Logic Programming — What Does it Bring to the Software Engineering (TK), pp. 134–138.
ILPC-1982-MaluszynskiN82 #comparison #programming language #prolog: A Comparison of the Logic Programming Language Prolog with Two-levels Grammars (JM, JFN), pp. 193–199.
ILPC-1982-Morris82 #relational #source code: Relational Production Systems and Logic Programs (PHM), pp. 187–192.
ILPC-1982-Shapiro82 #complexity #source code: Alternation and the Computational Complexity of Logic Programs (EYS), pp. 154–163.
CADE-1980-Bruynooghe #analysis #behaviour #dependence #source code: Analysis of Dependencies to Improve the Behaviour of Logic Programs (MB), pp. 293–305.
CADE-1980-PereiraP #backtracking #source code: Selective Backtracking for Logic Programs (LMP, AP), pp. 306–317.