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

• 
  Guohua Liu, Jia-Huai You:
  Relating weight constraint and aggregate programs: Semantics and representation. 1-31
• 
  Juan Carlos Nieves, Mauricio Osorio, Ulises Cortés:
  Semantics for Possibilistic Disjunctive Programs. 33-70
• 
  Phuong-Lan Nguyen, Bart Demoen:
  Representation sharing for Prolog. 71-106
• 
  Frederick Maier:
  Interdefinability of defeasible logic and logic programming under the well-founded semantics. 107-142

• 
  Wolfgang Faber, Nicola Leone:
  Introduction to the special issue on the 25th annual GULP conference. 147-148

• 
  Agostino Dovier, Andrea Formisano, Enrico Pontelli:
  Autonomous agents coordination: Action languages meet CLP() and Linda. 149-173
• 
  Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
  Generalization strategies for the verification of infinite state systems. 175-199
• 
  Laura Giordano, Alberto Martelli, Daniele Theseider Dupré:
  Reasoning about actions with Temporal Answer Sets. 201-225
• 
  Marco Manna, Francesco Ricca, Giorgio Terracina:
  Consistent query answering via ASP from different perspectives: Theory and practice. 227-252
• 
  Simona Perri, Francesco Ricca, Marco Sirianni:
  Parallel instantiation of ASP programs: techniques and experiments. 253-278
• 
  Fabrizio Riguzzi, Terrance Swift:
  Well-definedness and efficient inference for probabilistic logic programming under the distribution semantics. 279-302

• 
  Thomas Eiter, Esra Erdem, Halit Erdogan, Michael Fink:
  Finding similar/diverse solutions in answer set programming. 303-359
• 
  Kim Bauters, Steven Schockaert, Jeroen Janssen, Dirk Vermeir, Martine De Cock:
  Expressiveness of communication in answer set programming. 361-394
• 
  Cristina Feier, Stijn Heymans:
  Reasoning with Forest Logic Programs and f-hybrid knowledge bases. 395-463

Evelina Lamma, Terrance Swift (Eds.): Special Issue on the 29th International Conference on Logic Programming.

• 
  Evelina Lamma, Terrance Swift:
  Editorial: 29th International Conference on Logic Programming special issue. 465-470
• 
  Broes De Cat, Maurice Bruynooghe:
  Detection and exploitation of functional dependencies for model generation. 471-485
• 
  Rolf Schwitter:
  The jobs puzzle: Taking on the challenge via controlled natural language processing. 487-501
• 
  Vladimir Lifschitz, Fangkai Yang:
  Lloyd-Topor completion and general stable models. 503-515
• 
  Rehan Abdul Aziz, Geoffrey Chu, Peter J. Stuckey:
  Stable model semantics for founded bounds. 517-532
• 
  Tom Schrijvers, Bart Demoen, Benoit Desouter, Jan Wielemaker:
  Delimited continuations for prolog. 533-546
• 
  Marcello Balduccini:
  ASP with non-herbrand partial functions: a language and system for practical use. 547-561
• 
  Jia-Huai You, Heng Zhang, Yan Zhang:
  Disjunctive logic programs with existential quantification in rule heads. 563-578
• 
  Michael J. Maher:
  Relative expressiveness of defeasible logics II. 579-592
• 
  Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard, Peter J. Stuckey:
  Failure tabled constraint logic programming by interpolation. 593-607
• 
  Mirjana Mazuran, Edoardo Serra, Carlo Zaniolo:
  A declarative extension of horn clauses, and its significance for datalog and its applications. 609-623
• 
  Alejandro Arbelaez, Charlotte Truchet, Philippe Codognet:
  Using sequential runtime distributions for the parallel speedup prediction of SAT local search. 625-639
• 
  Laura Giordano, Alberto Martelli, Matteo Spiotta, Daniele Theseider Dupré:
  Business process verification with constraint temporal answer set programming. 641-655
• 
  Paula-Andra Busoniu, Johannes Oetsch, Jörg Pührer, Peter Skocovsky, Hans Tompits:
  SeaLion: An eclipse-based IDE for answer-set programming with advanced debugging support. 657-673
• 
  Roland Kaminski, Torsten Schaub, Anne Siegel, Santiago Videla:
  Minimal intervention strategies in logical signaling networks with ASP. 675-690
• 
  Joachim Jansen, Albert Jorissen, Gerda Janssens:
  Compiling Input* FO(·) inductive definitions into tabled prolog rules for IDP3. 691-704
• 
  Senlin Liang, Michael Kifer:
  A practical analysis of non-termination in large logic programs. 705-719
• 
  Elvira Albert, Maria J. García de la Banda, Miguel Gómez-Zamalloa, José Miguel Rojas, Peter J. Stuckey:
  A CLP heap solver for test case generation. 721-735
• 
  Sergio Greco, Cristian Molinaro, Irina Trubitsyna:
  Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments. 737-752
• 
  Mario Alviano, Rafael Peñaloza:
  Fuzzy answer sets approximations. 753-767
• 
  Jon Sneyers, Danny De Schreye, Thom W. Frühwirth:
  Probabilistic legal reasoning in CHRiSM. 769-781
• 
  Mutsunori Banbara, Takehide Soh, Naoyuki Tamura, Katsumi Inoue, Torsten Schaub:
  Answer set programming as a modeling language for course timetabling. 783-798
• 
  Vítor Santos Costa, David Vaz:
  BigYAP: Exo-compilation meets UDI. 799-813
• 
  Jiefei Ma, Franck Le, David Wood, Alessandra Russo, Jorge Lobo:
  A declarative approach to distributed computing: Specification, execution and analysis. 815-830
• 
  Esra Erdem, Volkan Patoglu, Zeynep G. Saribatur, Peter Schüller, Tansel Uras:
  Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach. 831-846
• 
  Paul Tarau:
  Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and Gödel numberings). 847-861
• 
  Michael Bartholomew, Joohyung Lee:
  On the stable model semantics for intensional functions. 863-876
• 
  Georg Gottlob, Marco Manna, Andreas Pieris:
  Combining decidability paradigms for existential rules. 877-892

• 
  Paulo Shakarian, Gerardo I. Simari, Devon Callahan:
  Reasoning about Complex Networks: A Logic Programming Approach.
• 
  Claudia Schulz, Francesca Toni:
  ABA-Based Answer Set Justification.
• 
  Edison Mera, Jan Wielemaker:
  Porting and refactoring Prolog programs: the PROSYN case study.
• 
  Lunjin Lu:
  Towards Parametrizing Logic Program Analysis: Two Examples.
• 
  Werner Nutt, Sergey Paramonov, Ognjen Savkovic:
  An ASP Approach to Query Completeness Reasoning.
• 
  Davide Ancona, Agostino Dovier:
  co-LP: Back to the Roots.
• 
  Vivek Nigam, Giselle Reis, Leonardo Lima:
  Checking Proof Transformations with ASP.
• 
  Ari Saptawijaya, Luís Moniz Pereira:
  Tabled Abduction in Logic Programs.
• 
  Vernon Asuncion, Yan Zhang, Heng Zhang, Yi Zhou:
  Constructive Circumscription.
• 
  Amira Zaki, Thom W. Frühwirth, Slim Abdennadher:
  Towards Inverse Execution of Constraint Handling Rules.
• 
  Alejandro Serrano, Pedro López-García, Francisco Bueno, Manuel V. Hermenegildo:
  Sized Type Analysis for Logic Programs.
• 
  Tony Ribeiro, Katsumi Inoue, Gauvain Bourgne:
  Combining Answer Set Programs for Adaptive and Reactive Reasoning.
• 
  Arne König, Torsten Schaub:
  Monitoring and Visualizing Answer Set Solving.
• 
  Viviana Mascardi, Davide Ancona:
  Attribute Global Types for Dynamic Checking of Protocols in Logic-based Multiagent Systems.
• 
  Jianmin Ji, Fangzhen Lin, Jia-Huai You:
  Computing Loops with at Most One External Support Rule for Basic Logic Programs with Arbitrary Constraint Atoms.
• 
  Lenz Belzner:
  Action Programming In Rewriting Logic.
• 
  Dimitar Sht. Shterionov, Theofrastos Mantadelis, Gerda Janssens:
  Pattern-Based Compaction for ProbLog Inference.
• 
  Michael Hanus:
  Adding Plural Arguments to Curry Programs.
• 
  Pieter Van Hertum, Joost Vennekens, Bart Bogaerts, Jo Devriendt, Marc Denecker:
  The effects of buying a new car: an extension of the IDP Knowledge Base System.
• 
  Ana Sofia Gomes, José Júlio Alferes:
  Extending Transaction Logic with External Actions.
• 
  Dalal Alrajeh, Rob Miller, Alessandra Russo, Sebastián Uchitel:
  Reasoning about Triggered Scenarios in Logic Programming.
• 
  Vinay K. Chaudhri, Stijn Heymans, Son Tran, Michael A. Wessel:
  Object-Oriented Knowledge Bases in Logic Programming.
• 
  Saadat Anwar, Chitta Baral, Katsumi Inoue:
  Encoding Petri Nets in Answer Set Programming for Simulation Based Reasoning.
• 
  Marcello Balduccini, Yuliya Lierler:
  Integration Schemas for Constraint Answer Set Programming: a Case Study.
• 
  Amir Aavani, Eugenia Ternovska, David G. Mitchell:
  Problem Solving with the Enfragmo System.
• 
  Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
  A Pigeon-Hole Based Encoding of Cardinality Constraints.

• 
  Marco Gavanelli, Martin Gebser:
  The ICLP 2013 Doctoral Consortium.
• 
  Roberto Amadini:
  Evaluation and Application of Portfolio Approaches in Constraint Programming.
• 
  Michael Bartholomew:
  The Role of Functions in the Stable Model Semantics.
• 
  Sergio Castro:
  LogicObjects: A Portable and Extensible Approach for Linguistic Symbiosis between an Object-Oriented and a Logic Programming Language.
• 
  Benoit Desouter:
  Implementing LP Systems with CP Techniques.
• 
  Carmine Dodaro:
  Engineering an Efficient Native ASP Solver.
• 
  Jorge Fandinno:
  Algebraic Approach to Causal Logic Programs.
• 
  Johannes Klaus Fichte:
  Backdoors to the Tractability of Answer Set Programming.
• 
  Amelia Harrison:
  The Semantics of Gringo and Proving Strong Equivalence.
• 
  Arne König:
  Visualizing Answer Set Programming.
• 
  Ari Saptawijaya:
  Towards Computational Morality with Logic Programming.
• 
  Claudia Schulz:
  Argumentation for Answer Set Programming and other Non-monotonic Reasoning Systems.
• 
  Laura Titolo:
  An Abstract Interpretation Framework for Verification of Timed Concurrent Constraint Languages.
• 
  Fangkai Yang:
  Representing Actions in Logic-based Languages.

• 
  Martín O. Moguillansky, Nicolás D. Rotstein, Marcelo A. Falappa, Alejandro Javier García, Guillermo Ricardo Simari:
  Dynamics of knowledge in DeLP through Argument Theory Change. 893-957
• 
  Quan Phan, Gerda Janssens, Zoltan Somogyi:
  Region-based memory management for Mercury programs. 959-1024

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-11-17 22:51 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: