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

• 
  Rafael Caballero, Mario Rodríguez-Artalejo, Carlos A. Romero-Díaz:
  A Transformation-based implementation for CLP with qualification and proximity. 1-63
• 
  Adrián Riesco, Juan Rodríguez-Hortalá:
  Singular and plural functions for functional logic programming. 65-116
• 
  Francesco Calimeri, Giovambattista Ianni, Francesco Ricca:
  The third open answer set programming competition. 117-135

• 
  Jouko Väänänen:
  Independence-Friendly Logic: A Game-Theoretic Approach, Allen L. Mann, Gabriel Sandu and Merlijn Sevenster, Cambridge University Press, 2011. Paperback, ISBN 9780521149341, 216 pp. 137-140

• 
  Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran:
  Tractable answer-set programming with weight constraints: bounded treewidth is not enough. 141-164
• 
  Francisco Javier López-Fraguas, Enrique Martin-Martin, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández:
  Rewriting and narrowing for constructor systems with call-time choice semantics. 165-213
• 
  Lee Naish:
  Transforming floundering into success. 215-238
• 
  Ana Sofia Gomes, José Júlio Alferes, Terrance Swift:
  A goal-directed implementation of query answering for hybrid MKNF knowledge bases. 239-264

• 
  Frank Pfenning:
  Programming with Higher-Order Logic, by Dale Miller and Gopalan Nadathur, Cambridge University Press, 2012, Hardcover, ISBN-10: 052187940X, xiv + 306 pp. 265-267

• 
  Michael Hanus, Sven Koschnicke:
  An ER-based framework for declarative web programming. 269-291
• 
  Daniel Trivellato, Nicola Zannone, Sandro Etalle:
  GEM: A distributed goal evaluation algorithm for trust management. 293-337
• 
  Mario Alviano, Wolfgang Faber, Stefan Woltran:
  Complexity of super-coherence problems in ASP. 339-361

• 
  Bart Demoen, Maria Garcia de la Banda:
  Redundant Sudoku rules. 363-377
• 
  Gianluca Amato, Francesca Scozzari:
  Optimal multibinding unification for sharing and linearity analysis. 379-400

Michael Leuschel, Tom Schrijvers (Eds.): Special Issue on the 30th International Conference on Logic Programming.

• 
  Michael Leuschel, Tom Schrijvers:
  Introduction to the 30th International Conference on Logic Programming Special Issue. 401-414
• 
  Kyle Marple, Gopal Gupta:
  Dynamic Consistency Checking in Goal-Directed Answer Set Programming. 415-427
• 
  Theofrastos Mantadelis, Ricardo Rocha, Paulo Moura:
  Tabling, Rational Terms, and Coinduction Finally Together! 429-443
• 
  Ilias Tachmazidis, Grigoris Antoniou, Wolfgang Faber:
  Efficient Computation of the Well-Founded Semantics over Big Data. 445-459
• 
  Aya Saad, Thom W. Frühwirth, Carmen Gervet:
  The P-Box CDF-Intervals: A Reliable Constraint Reasoning with Quantifiable Information. 461-475
• 
  Bart Bogaerts, Joachim Jansen, Maurice Bruynooghe, Broes De Cat, Joost Vennekens, Marc Denecker:
  Simulating Dynamic Systems Using Linear Time Calculus Theories. 477-492
• 
  Flávio Cruz, Ricardo Rocha, Seth Copen Goldstein, Frank Pfenning:
  A Linear Logic Programming Language for Concurrent Programming over Graph Structures. 493-507
• 
  Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro:
  SUNNY: a Lazy Portfolio Approach for Constraint Solving. 509-524
• 
  Daniel Gall, Thom W. Frühwirth:
  Exchanging Conflict Resolution in an Adaptable Implementation of ACT-R. 525-538
• 
  Torbjörn Lager, Jan Wielemaker:
  Pengines: Web Logic Programming Made Easy. 539-552
• 
  Terrance Swift:
  Incremental Tabling in Support of Knowledge Representation and Reasoning. 553-567
• 
  Holger H. Hoos, Marius Lindauer, Torsten Schaub:
  claspfolio 2: Advances in Algorithm Selection for Answer Set Programming. 569-585
• 
  Michael Gelfond, Yuanlin Zhang:
  Vicious Circle Principle and Logic Programs with Aggregates. 587-601
• 
  Pedro Cabalar, Jorge Fandinno, Michael Fink:
  Causal Graph Justifications of Logic Programs. 603-618
• 
  Gregory J. Duck, Rémy Haemmerlé, Martin Sulzmann:
  On Termination, Confluence and Consistent CHR-based Type Inference. 619-632
• 
  Luís Moniz Pereira, Emmanuelle-Anna Dietz, Steffen Hölldobler:
  Contextual Abductive Reasoning with Side-Effects. 633-648
• 
  Elaine Pimentel, Carlos Olarte, Vivek Nigam:
  A Proof Theoretic Study of Soft Concurrent Constraint Programming. 649-663
• 
  Luciano Caroprese, Irina Trubitsyna, Miroslaw Truszczynski, Ester Zumpano:
  A Measure of Arbitrariness in Abductive Explanations. 665-679
• 
  Elena Bellodi, Evelina Lamma, Fabrizio Riguzzi, Vítor Santos Costa, Riccardo Zese:
  Lifted Variable Elimination for Probabilistic Logic Programming. 681-695
• 
  Roman Barták, Neng-Fa Zhou:
  Using Tabled Logic Programming to Solve the Petrobras Planning Problem. 697-710
• 
  Christian Antic:
  On Cascade Products of Answer Set Programs. 711-723
• 
  Angelos Charalambidis, Zoltán Ésik, Panos Rondogiannis:
  Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation. 725-737
• 
  Alejandro Serrano, Pedro López-García, Manuel V. Hermenegildo:
  Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types. 739-754
• 
  Mario Alviano, Carmine Dodaro, Francesco Ricca:
  Anytime Computation of Cautious Consequences in Answer Set Programming. 755-770
• 
  Ethan K. Jackson:
  A Module System for Domain-Specific Languages. 771-785
• 
  Marco Comini, Laura Titolo, Alicia Villanueva:
  Abstract Diagnosis for tccp using a Linear Temporal Logic. 787-801

• 
  Lee Naish, Harald Søndergaard:
  Truth versus information in logic programming. 803-840
• 
  Marco Maratea, Luca Pulina, Francesco Ricca:
  A multi-engine approach to answer-set programming. 841-868
• 
  Martin Slota, João Leite:
  The rise and fall of semantic rule updates based on SE-models. 869-907
• 
  Taisuke Sato, Philipp J. Meyer:
  Infinite probability computation by cyclic explanation graphs. 909-937

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-04 22:08 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: