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

• 
  Germán Puebla, Elvira Albert, Manuel V. Hermenegildo:
  Efficient local unfolding with ancestor stacks. 1-32
• 
  Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp:
  Polytool: Polynomial interpretations as a basis for termination analysis of logic programs. 33-63
• 
  Frank Raiser, Thom W. Frühwirth:
  Analysing graph transformation systems through constraint handling rules. 65-109
• 
  Victor W. Marek, Jeffrey B. Remmel:
  Guarded resolution for Answer Set Programming. 111-123

• 
  Éric Monfroy:
  Constraint Handling Rules by Thom Frühwirth, Cambridge University Press, 2009. Hard cover: ISBN 978-0-521-87776-3. 125-126
• 
  Marijn Heule:
  Introduction to Mathematics of Satisfiability, Victor W. Marek, Chapman & Hall/CRC, 2009. Hardback, ISBN-13: 978-143980167-3, $89.95. 126-130

• 
  Maria Garcia de la Banda, Enrico Pontelli:
  Introduction to the 24th international conference on logic programming special issue. 131-133
• 
  Yuliya Lierler:
  Abstract answer set solvers with backjumping and learning. 135-169
• 
  Michael Fink:
  A general framework for equivalences in Answer-Set Programming by countermodels in the logic of Here-and-There. 171-202
• 
  Pedro Cabalar:
  Functional answer set programming. 203-233
• 
  Angelika Kimmig, Bart Demoen, Luc De Raedt, Vítor Santos Costa, Ricardo Rocha:
  On the implementation of the probabilistic logic programming language ProbLog. 235-262
• 
  Shay B. Cohen, Robert J. Simmons, Noah A. Smith:
  Products of weighted logic programs. 263-296
• 
  Yuanlin Zhang, Roland H. C. Yap:
  Solving functional constraints by variable substitution. 297-322
• 
  Martin Gebser, Torsten Schaub, Sven Thiele, Philippe Veber:
  Detecting inconsistencies in large biological networks with answer set programming. 323-360
• 
  Alessandra Mileo, Davide Merico, Roberto Bisiani:
  Reasoning support for risk prediction and prevention in independent living. 361-395
• 
  Georg Boenn, Martin Brain, Marina De Vos, John P. Fitch:
  Automatic music composition using answer set programming. 397-427

John P. Gallagher, Michael Gelfond (Eds.): Proceedings of ICLP 2011, Lexington, Kentucky. USA

Technical communications of this conference are published in LIPIcs 11.

• 
  John P. Gallagher, Michael Gelfond:
  Introduction to the 27th International Conference on Logic Programming Special Issue. 429-432
• 
  Fabrizio Riguzzi, Terrance Swift:
  The PITA system: Tabling and answer subsumption for reasoning under uncertainty. 433-449
• 
  Conrad Drescher, Michael Thielscher:
  ALPprolog - A new logic programming method for dynamic domains. 451-468
• 
  Rémy Haemmerlé:
  Observational equivalences for linear logic concurrent constraint languages. 469-485
• 
  Marco Comini, Laura Titolo, Alicia Villanueva:
  Abstract diagnosis for timed concurrent constraint programs. 487-502
• 
  Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl:
  SAT-based termination analysis using monotonicity constraints over the integers. 503-520
• 
  Dean Voets, Danny De Schreye:
  Non-termination analysis of logic programs with integer arithmetics. 521-536
• 
  Jael Kriener, Andy King:
  RedAlert: Determinacy inference for Prolog. 537-553
• 
  Pablo Chico de Guzmán, Amadeo Casas, Manuel Carro, Manuel V. Hermenegildo:
  Parallel backtracking with answer memoing for independent and-parallelism. 555-574
• 
  Paul Bone, Zoltan Somogyi, Peter Schachte:
  Estimating the overlap between dependent computations for automatic parallelization. 575-591
• 
  Rémy Haemmerlé:
  (Co-)Inductive semantics for Constraint Handling Rules. 593-609
• 
  António Porto:
  A structured alternative to Prolog with simple compositional semantics. 611-627
• 
  Yuliya Lierler, Miroslaw Truszczynski:
  Transition systems for model generators - A unifying approach. 629-646
• 
  Joost Vennekens:
  Actual causation in CP-logic. 647-662
• 
  Bernd Gutmann, Ingo Thon, Angelika Kimmig, Maurice Bruynooghe, Luc De Raedt:
  The magic of logical inference in probabilistic programming. 663-680
• 
  Miguel Areias, Ricardo Rocha:
  On combining linear-based strategies for tabled evaluation of logic programs. 681-696
• 
  Flávio Cruz, Ricardo Rocha:
  Efficient instance retrieval of subgoals for subsumptive tabled evaluation of logic programs. 697-712
• 
  Sergio Antoy:
  On the correctness of pull-tabbing. 713-730
• 
  Massimiliano Cattafi, Marco Gavanelli, Maddalena Nonato, Stefano Alvisi, Marco Franchini:
  Optimal placement of valves in a water distribution network with CLP(FD). 731-747
• 
  Markus Durzinsky, Wolfgang Marwan, Max Ostrowski, Torsten Schaub, Annegret Wagler:
  Automatic network reconstruction using ASP. 749-766
• 
  Stefan Hallerstede, Michael Leuschel:
  Constraint-based deadlock checking of high-level specifications. 767-782
• 
  Domenico Corapi, Alessandra Russo, Marina De Vos, Julian A. Padget, Ken Satoh:
  Normative design using inductive learning. 783-799
• 
  Martin Slota, João Leite, Terrance Swift:
  Splitting and updating hybrid knowledge bases. 801-819
• 
  Martin Gebser, Roland Kaminski, Torsten Schaub:
  Complex optimization in answer set programming. 821-839

• 
  Edmund S. L. Lam, Martin Sulzmann:
  Concurrent goal-based execution of Constraint Handling Rules. 841-879
• 
  Miroslaw Truszczynski:
  Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs. 881-904
• 
  Luciano Caroprese, Miroslaw Truszczynski:
  Active integrity constraints and revision programming. 905-952
• 
  Martin Gebser, Joohyung Lee, Yuliya Lierler:
  On elementary loops of logic programs. 953-988

• 
  Rosella Gennari:
  Mathematical Logic: Foundations for Information Science by Wei Li, Birkhäuser, Berlin, 2010. Hardcover, ISBN-978-3-7643-9976-4. 989-992

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-04-24 21:06 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: