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

• 
  Bart Demoen, Maria Garcia de la Banda:
  Introduction to the special issue on Prolog systems. 1-4

• 
  Vítor Santos Costa, Ricardo Rocha, Luís Damas:
  The YAP Prolog system. 5-34
• 
  Mats Carlsson, Per Mildner:
  SICStus Prolog - The first 25 years. 35-66
• 
  Jan Wielemaker, Tom Schrijvers, Markus Triska, Torbjörn Lager:
  SWI-Prolog. 67-96
• 
  Paul Tarau:
  The BinProlog experience: Architecture and implementation choices for continuation passing Prolog and first-class logic engines. 97-126
• 
  Joachim Schimpf, Kish Shen:
  ECLⁱPS^e - From LP to CLP. 127-156
• 
  Terrance Swift, David Scott Warren:
  XSB: Extending Prolog with Tabled Logic Programming. 157-187
• 
  Neng-Fa Zhou:
  The language features and architecture of B-Prolog. 189-218
• 
  Manuel V. Hermenegildo, Francisco Bueno, Manuel Carro, Pedro López-García, Edison Mera, José F. Morales, Germán Puebla:
  An overview of Ciao and its design philosophy. 219-252
• 
  Daniel Diaz, Salvador Abreu, Philippe Codognet:
  On the implementation of GNU Prolog. 253-282

• 
  Elvira Albert, Puri Arenas, Germán Puebla, Manuel V. Hermenegildo:
  Certificate size reduction in abstraction-carrying code. 283-318
• 
  Ricardo Lopes, Vítor Santos Costa, Fernando M. A. Silva:
  A design and implementation of the Extended Andorra Model. 319-360
• 
  Francesco Ricca, Giovanni Grasso, Mario Alviano, Marco Manna, Vincenzino Lio, Salvatore Iiritano, Nicola Leone:
  Team-building with answer set programming in the Gioia-Tauro seaport. 361-381
• 
  Paolo Ferraris, Joohyung Lee, Yuliya Lierler, Vladimir Lifschitz, Fangkai Yang:
  Representing first-order causal theories by logic programs. 383-412

• 
  Panos Rondogiannis:
  Models and Games by Jouko Väänänen, Cambridge University Press, Cambridge Studies in Advanced Mathematics Series 132, 2011. Hardcover, ISBN 978-0-521-51812-3, 367 pp. 413-416
• 
  Krzysztof R. Apt:
  Logic: A Brief Course by Daniele Mundici, Springer, 2012. Paperback, ISBN 978-88-470-2360-4, xi + 124 pp. 417-419

Agostino Dovier, Vítor Santos Costa (Eds.): Special Issue on the 28th International Conference on Logic Programming.

Technical communications of ICLP 2012 are published in LIPIcs 17.

• 
  Agostino Dovier, Vítor Santos Costa:
  Introduction to the 28th international conference on logic programming special issue. 421-426
• 
  Miguel Areias, Ricardo Rocha:
  Towards multi-threaded local tabling using a common table space. 427-443
• 
  Bernhard Bliem, Michael Morak, Stefan Woltran:
  D-FLAT: Declarative problem solving using tree decompositions and answer-set programming. 445-464
• 
  Amit Metodi, Michael Codish:
  Compiling finite domain constraints to SAT with BEE. 465-483
• 
  Max Ostrowski, Torsten Schaub:
  ASP modulo CSP: The clingcon system. 485-503
• 
  Muhammad Asiful Islam, C. R. Ramakrishnan, I. V. Ramakrishnan:
  Inference in probabilistic logic programs with continuous random variables. 505-523
• 
  Martin Gebser, Benjamin Kaufmann, Torsten Schaub:
  Multi-threaded ASP solving with clasp. 525-545
• 
  Neng-Fa Zhou, Christian Theil Have:
  Efficient tabling of structured data with enhanced hash-consing. 547-563
• 
  Vladimir Lifschitz, Karl Pichotta, Fangkai Yang:
  Relational theories with null values and non-herbrand stable models. 565-582
• 
  Germán Vidal:
  Annotation of logic programs for independent AND-parallelism by partial evaluation. 583-600
• 
  Gregory J. Duck:
  SMCHR: Satisfiability modulo constraint handling rules. 601-618
• 
  Marina De Vos, Doga Gizem Kisa, Johannes Oetsch, Jörg Pührer, Hans Tompits:
  Annotating answer-set programs in Lana. 619-637
• 
  Iliano Cervesato:
  An Improved Proof-Theoretic Compilation of Logic Programs. 639-657
• 
  Thomas Eiter, Michael Fink, Thomas Krennwallner, Christoph Redl:
  Conflict-driven ASP solving with external sources. 659-679
• 
  Andrey Gorlin, C. R. Ramakrishnan, Scott A. Smolka:
  Model checking with probabilistic tabled logic programming. 681-700
• 
  Mario Alviano, Wolfgang Faber, Nicola Leone, Marco Manna:
  Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues. 701-718
• 
  Joseph Babb, Joohyung Lee:
  Module theorem for the general theory of stable models. 719-735
• 
  Rémy Haemmerlé:
  Diagrammatic confluence for Constraint Handling Rules. 737-753
• 
  José F. Morales, Rémy Haemmerlé, Manuel Carro, Manuel V. Hermenegildo:
  Lightweight compilation of (C)LP to JavaScript. 755-773
• 
  Chitta Baral, Juraj Dzifcak, Marcos Alvarez Gonzalez, Aaron Gottesman:
  Typed answer set programming lambda calculus theories and correctness of inverse lambda algorithms with respect to them. 775-791
• 
  Michael J. Maher:
  Relative expressiveness of defeasible logics. 793-810

• 
  Jeroen Janssen, Dirk Vermeir, Steven Schockaert, Martine De Cock:
  Reducing fuzzy answer set programming to model finding in fuzzy logics. 811-842
• 
  Eric Martin:
  Contextual hypotheses and semantics of logic programs. 843-887
• 
  Michael A. Covington, Roberto Bagnara, Richard A. O'Keefe, Jan Wielemaker, Simon Price:
  Coding guidelines for Prolog. 889-927
• 
  Wlodzimierz Drabent:
  A simple correctness proof for magic transformation. 929-936

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 2025-12-12 01:09 CET 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: