Stop the war!

Остановите войну!

• solidarity - (ua) - (ru)
• news - (ua) - (ru)
• donate - donate - donate

for scientists:

• ERA4Ukraine
• Assistance in Germany
• Ukrainian Global University
• #ScienceForUkraine

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches

• 

Venues:

• no matches

• 

Publications:

• no matches

• 

ask others

• Google
• Google Scholar
• Semantic Scholar
• Internet Archive Scholar
• CiteSeerX
• ORCID

Refine list

refinements active!

zoomed in on ?? of ?? records

dismiss all constraints

view refined list in

dblp search

export refined list as

XML

JSON

JSONP

BibTeX

showing all ?? records

Joint International Conference and Symposium on Logic Programming

• 
  Michael J. Maher:
  Logic Programming, Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, Bonn, Germany, September 2-6, 1996. MIT Press 1996, ISBN 0-262-63173-3

• 
  Jean-Francois Puget:
  Constraint Programming (Abstract). 3

• 
  Frédéric Mesnard:
  Inferring Left-terminating Classes of Queries for Constraint Logic Programs. 7-21
• 
  Philippe Refalo, Pascal Van Hentenryck:
  CLP(Rlin) Revised. 22-36
• 
  Andrew D. Kelly, Andrew D. Macdonald, Kim Marriott, Peter J. Stuckey, Roland H. C. Yap:
  Effectiveness of Optimizing Compilation for CLP(R). 37-51

• 
  Matteo Baldoni, Laura Giordano, Alberto Martelli:
  A Framework for a Modal Logic Programming. 52-66
• 
  Michele Bugliesi, Giorgio Delzanno, Luigi Liquori, Maurizio Martelli:
  A Linear Logic Calculus Objects. 67-81
• 
  Chiaki Sakama, Katsumi Inoue:
  Representing Priorities in Logic Programs. 82-96

• 
  Neng-Fa Zhou:
  A Novel Implementation Method of Delay. 97-111
• 
  Prasad Rao, C. R. Ramakrishnan, I. V. Ramakrishnan:
  A Thread in Time Saves Tabling Time. 112-126
• 
  Ulrich Neumerkel:
  Interprocedural Register Allocation for the WAM based on Source to Source Transformations. 127-141

• 
  Anthony J. Bonner, Michael Kifer:
  Concurrency and Communication in Transaction Logic. 142-156
• 
  Hendrik Decker:
  An Extension of SLD by Abduction and Integrity Maintenance for View Updating in Deductive Databases. 157-169
• 
  Marc Denecker, Kristof Van Belleghem, Guy Duchatelet, Frank Piessens, Danny De Schreye:
  A Realistic Experiment in Knowledge Representation in Open Event Calculus: Protocol Specification. 170-184

• 
  Lee Naish:
  A Declarative View of Modes. 185-199
• 
  Jichang Tan, I-Peng Lin:
  Type Synthesis for Logic Programs. 200-214
• 
  Kenta Cho, Kazunori Ueda:
  Diagnosing Non-Well-Moded Concurrent Logic Programs. 215-229

• 
  Andreas Hamfelt, Jørgen Fischer Nilsson:
  Declarative Logic Programming with Primitive Recursive Relations on Lists. 230-243
• 
  Olivier Ridoux:
  Engineering Transformations of Attributed Grammars in LambdaProlog. 244-258
• 
  Gilles Dowek, Thérèse Hardin, Claude Kirchner, Frank Pfenning:
  Unification via Explicit Substitutions: The Case of Higher-Order Patterns. 259-273

• 
  Konstantinos Sagonas, Terrance Swift, David Scott Warren:
  An Abstract Machine for Computing the Well-Founded Semantics. 274-288
• 
  Ilkka Niemelä, Patrik Simons:
  Efficient Implementation of the Well-founded and Stable Model Semantics. 289-303
• 
  Ulrich Zukowski, Burkhard Freitag:
  Adding Flexibility to Query Evaluation for Modularly Stratified Databases. 304-318

• 
  Michael Leuschel, Danny De Schreye, D. Andre de Waal:
  A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration. 319-332
• 
  Moreno Falaschi, Patrick Hicks, William H. Winsborough:
  Demand Transformation Analysis for Concurrent Constraint Programs. 333-347
• 
  Gilberto Filé, Francesco Ranzato:
  Complementation of Abstract Domains made Easy. 348-362

• 
  Yves Caseau, François Laburthe:
  Cumulative Scheduling with Task Intervals. 363-377
• 
  Olivier Lhomme, Arnaud Gotlieb, Michel Rueher, Patrick Taillibert:
  Boosting the Interval Narrowing Algorithm. 378-392
• 
  M. R. K. Krishna Rao:
  Completeness Results for Basic Narrowing in Non-Copying Implementations. 393-407

• 
  Pawel Cholewinski, Miroslaw Truszczynski:
  Extremal Problems in Logic Programming and Stable Model Computation. 408-422
• 
  Shekhar Pradhan:
  Logic Programs with Contested Information. 423-437
• 
  Stefania Costantini, Gaetano Aurelio Lanzarone, Giuseppe Magliocco:
  Asserting Lemmas in the Stable Model Semantics. 438-452

• 
  François Bry:
  A Compositional Semantics for Logic Programs and Deductive Databases. 453-467
• 
  Sandro Etalle, Frank Teusink:
  A Compositional Semantics for Normal Open Programs. 468-482
• 
  Michael Thielscher:
  A Nonmonotonic Disputation-Based Semantics and Proof Procedure for Logic Programs. 483-497

• 
  Anthony J. Kusalik, Steven D. Prestwich:
  Visualizing Parallel Logic Program Execution for Performance Tuning. 498-512
• 
  Kish Shen:
  Initial Results of the Parallel Implementation of DASWAM. 513-527

• 
  Stefan Lüttringhaus-Kappel, Dirk Schulz:
  Applications of Efficient Lazy Set Expression (Poster Abstract). 531
• 
  Wolfram Burgard, Armin B. Cremers, Dieter Fox, Angelica Maria Kappel, Stefan Lüttringhaus-Kappel:
  Logic Programming Tools Applied to Fire Detection in Hard-coal Mines (Poster Abstract). 532
• 
  Thomas H. Kolbe:
  Recognition of 3D Objects in Aerial Images on Generic Models (Poster Abstract). 533
• 
  Mireille Ducassé, Jacques Noyé:
  Tracing Prolog without a Tracer (Poster Abstract). 534
• 
  Gerhard Wetzel, Robert A. Kowalski, Francesca Toni:
  PROCALOG - Programming with Constraints and Abducibles in Logic (Poster Abstract). 535
• 
  Rolf Schwitter, Norbert E. Fuchs:
  Attempto Controlled English (ACE) A Seemingly Informal Bridgehead in Formal Territory (Poster Abstract). 536
• 
  Andreas Fordan, Ulrich Geske, Alexander Nareyek:
  Optimizing Constraint-Intensive Problems Using Early Projection (Poster Abstract). 537
• 
  Juliana Freire, Terrance Swift, David Scott Warren:
  Logic Programming and Databases Integrated at Last? (Poster Abstract). 538
• 
  Alberto Pettorossi, Maurizio Proietti, Sophie Renault:
  How to Extend Partial Deduction to Derive the KMP String-Matching Algorithm from a Naive Specification (Poster Abstract). 539
• 
  Pierre Deransart, Patrick Parot, Roberto da Silva Bigonha, José de Siqueira:
  A Hypertext Based Environment to Write Literate Logic Programs (Poster Abstract). 540
• 
  Liem Ngo:
  Probabilistic Disjunctive Deductive Databases (Poster Abstract). 541
• 
  Enrico Pontelli, Gopal Gupta:
  Dependent And-Parallelism Revisited (Poster Abstract). 542
• 
  Michael Jampel, Jean-Marie Jacquet, David R. Gilbert:
  A General Framework for Integrating HCLP and PCSP (Poster Abstract). 543
• 
  H. Lewis Chau:
  Specification of Complex Systems with Definite Clause Grammar (Poster Abstract). 544
• 
  Naoyuki Tamura, Yukio Kaneda:
  Resource Management Method for a Compiler System of a Linear Logic Programming Language (Poster Abstract). 545
• 
  Chandrabose Aravindan, Peter Baumgartner, Jürgen Dix, Ulrich Furbach, Gerd Neugebauer, Ilkka Niemelä, Dorothea Schäfer, Frieder Stolzenburg:
  On Merging Theorem Proving and Logic Programming Paradigms (Poster Abstract). 546
• 
  Sven-Erik Bornscheuer:
  Generating Rational Models (Poster Abstract). 547
• 
  Michael Dobrohoczki, Anthony J. Kusalik, Eric Neufeld:
  Colour Tagging for Prolog Visualization (Poster Abstract). 548
• 
  Ulrich Neumerkel:
  GUPU: A Prolog Course Environment and its Programming Methodology (Poster Abstract). 549

a service of  

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

last updated on 2024-04-25 20:48 CEST by the dblp team

 all metadata released as open data under CC0 1.0 license

see also: Terms of Use | Privacy Policy | Imprint

dblp was originally created in 1993 at:

 

since 2018, dblp has been operated and maintained by:

 

the dblp computer science bibliography is funded and supported by: