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

• 
  José F. Morales, Manuel Carro, Manuel V. Hermenegildo:
  Description and Optimization of Abstract Machines in a Dialect of Prolog. 1-58
• 
  Claudia Schulz, Francesca Toni:
  Justifying answer sets using argumentation. 59-110
• 
  Nicolas Schwind, Katsumi Inoue:
  Characterization of logic program revision as an extension of propositional revision. 111-138

• 
  Georg Gottlob, Marco Manna, Andreas Pieris:
  Combining decidability paradigms for existential rules. Theory and Practice of Logic Programming - Corrigendum. 139

• 
  Besik Dundua, Mário Florido, Temur Kutsia, Mircea Marin:
  CLP(H): Constraint logic programming for hedges. 141-162
• 
  Akihisa Yamada, Sarah Winkler, Nao Hirokawa, Aart Middeldorp:
  AC-KBO revisited. 163-188
• 
  Daniela Inclezan, Michael Gelfond:
  Modular action language. 189-235

• 
  Victor W. Marek:
  All about Proofs, Proofs for All, Bruno Woltzenlogel Paleo and David Delahaye, Eds., College Publications, Series Mathematical Logic and Foundations, vol. 55., 2015. Paperback, ISBN 978-1-84890-166-7, vii + 240 pages. 236-241

• 
  Antonis Bikakis, Paul Fodor, Adrian Giurca, Leora Morgenstern:
  Introduction to the special issue on the International Web Rule Symposia 2012-2014. 243-246

• 
  Sofie De Clercq, Steven Schockaert, Martine De Cock, Ann Nowé:
  Solving stable matching problems using answer set programming. 247-268
• 
  Robert A. Kowalski, Fariba Sadri:
  Programming in logic without logic programming. 269-295
• 
  Guido Governatori, Francesco Olivieri, Simone Scannapieco, Antonino Rotolo, Matteo Cristani:
  The rationale behind the concept of goal. 296-324
• 
  Theodore Patkos, Dimitris Plexousakis, Abdelghani Chibani, Yacine Amirat:
  An event calculus production rule system for reasoning in dynamic and uncertain domains. 325-352
• 
  Marco Calautti, Sergio Greco, Cristian Molinaro, Irina Trubitsyna:
  Using linear constraints for logic program termination analysis. 353-377

• 
  Tom J. Ameloot, Jan Van den Bussche, William R. Marczak, Peter Alvaro, Joseph M. Hellerstein:
  Putting logic-based distributed systems on stable grounds. 378-417
• 
  Thomas Eiter, Michael Fink, Giovambattista Ianni, Thomas Krennwallner, Christoph Redl, Peter Schüller:
  A model building framework for answer set programming with external computations. 418-464
• 
  Rémi Brochenin, Marco Maratea, Yuliya Lierler:
  Disjunctive answer set solvers via templates. 465-497
• 
  Wlodzimierz Drabent:
  On definite program answers and least Herbrand models. 498-508

Manuel Carro, Andy King (Eds.): Special Issue on the 32nd International Conference on Logic Programming.

• 
  Manuel Carro, Andy King:
  Introduction to the 32nd International Conference on Logic Programming Special Issue. 509-514
• 
  María Alpuente, Francisco Frechina, Julia Sapiña, Demis Ballis:
  Assertion-based analysis via slicing with ABETS. 515-532
• 
  Mario Alviano, Carmine Dodaro:
  Anytime answer set optimization via unsatisfiable core shrinking. 533-551
• 
  Manuel Bichler, Michael Morak, Stefan Woltran:
  The power of non-ground rules in Answer Set Programming. 552-569
• 
  Bart Bogaerts, Tomi Janhunen, Shahab Tasharrofi:
  Stable-unstable semantics: Beyond NP with normal logic programs. 570-586
• 
  Pedro Cabalar, Jorge Fandinno:
  Justifications for programs with disjunctive and causal-choice rules. 587-603
• 
  Zhuo Chen, Kyle Marple, Elmer Salazar, Gopal Gupta, Lakshman Tamil:
  A Physician Advisory System for Chronic Heart Failure management based on knowledge patterns. 604-618
• 
  Stefania Costantini, Andrea Formisano:
  Query answering in resource-based answer set semantics. 619-635
• 
  Jo Devriendt, Bart Bogaerts, Maurice Bruynooghe, Marc Denecker:
  On local domain symmetry for model expansion. 636-652
• 
  Carmine Dodaro, Philip Gasteiger, Nicola Leone, Benjamin Musitsch, Francesco Ricca, Konstantin Schekotihin:
  Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper). 653-669
• 
  Jorge Fandinno:
  Deriving conclusions from non-monotonic cause-effect relations. 670-687
• 
  Michael Frank, Michael Codish:
  Logic Programming with Graph Automorphism: Integrating nauty with Prolog (Tool Description). 688-702
• 
  Tiantian Gao, Paul Fodor, Michael Kifer:
  Paraconsistency and word puzzles. 703-720
• 
  Isabel Garcia-Contreras, José F. Morales, Manuel V. Hermenegildo:
  Semantic code browsing. 721-737
• 
  Laura Giordano, Daniele Theseider Dupré:
  ASP for minimal entailment in a rational extension of SROEL. 738-754
• 
  Amelia Harrison, Yuliya Lierler:
  First-order modular logic programs and their conservative extensions. 755-770
• 
  Amelia Harrison, Vladimir Lifschitz:
  Stable models for infinitary formulas with extensional atoms. 771-786
• 
  Amelia Harrison, Vladimir Lifschitz, Julian Michael:
  Proving infinitary formulas. 787-799
• 
  Daniela Inclezan:
  CoreALMlib: An ALM library translated from the Component Library. 800-816
• 
  Nikos Katzouris, Alexander Artikis, Georgios Paliouras:
  Online learning of event definitions. 817-833
• 
  Mark Law, Alessandra Russo, Krysia Broda:
  Iterative Learning of Answer Set Programs from Context Dependent Examples. 834-848
• 
  Pedro López-García, Maximiliano Klemen, Umer Liqat, Manuel V. Hermenegildo:
  A general framework for static profiling of parametric resource usage. 849-865
• 
  Christoph Redl:
  The dlvhex system for knowledge representation: recent advances (system description). 866-883
• 
  Amr Hany Saleh, Tom Schrijvers:
  Efficient algebraic effect handlers for Prolog. 884-898
• 
  João Santos, Ricardo Rocha:
  On the Implementation of an Or-Parallel Prolog System for Clusters of Multicores. 899-915
• 
  K. Tuncay Tekle, Yanhong A. Liu:
  Precise complexity guarantees for pointer analysis via Datalog with extensions. 916-932
• 
  Alexander Vandenbroucke, Maciej Piróg, Benoit Desouter, Tom Schrijvers:
  Tabling with Sound Answer Subsumption. 933-949
• 
  Jan Wielemaker, Keri Harris:
  Lock-free atom garbage collection for multithreaded Prolog. 950-965

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-11-26 20:34 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: