Stop the war!

Остановите войну!

• solidarity - (ua) - (ru)
• news - (ua) - (ru)
• donate - donate - donate

for scientists:

• ERA4Ukraine
• Assistance in Germany
• Ukrainian Global University
• #ScienceForUkraine

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

• 
  Ricardo Rocha, Tran Cao Son, Christopher Mears, Neda Saeedloei:
  Technical Communications of the 33rd International Conference on Logic Programming, ICLP 2017, August 28 to September 1, 2017, Melbourne, Australia. OASIcs 58, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-058-3

The regular papers of this conference are published in Theory and Practice of Logic Programming, Volume 17 (5-6)

• 
  Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xii
• 
  Weronika T. Adrian, Marco Manna, Nicola Leone, Giovanni Amendola, Marek Adrian:
  Entity set expansion from the Web via ASP. 1:1-1:5
• 
  Mario Alviano:
  The Pyglaf Argumentation Reasoner. 2:1-2:3
• 
  Giovanni Amendola, Nicola Leone, Marco Manna, Pierfrancesco Veltri:
  Reasoning on anonymity in Datalog+/-. 3:1-3:5
• 
  Melisachew Wudage Chekol, Heiner Stuckenschmidt:
  Rule Based Temporal Inference. 4:1-4:14
• 
  Michael Codish, Michael Frank, Amit Metodi, Morad Muslimany:
  Logic Programming with Max-Clique and its Application to Graph Coloring (Tool Description). 5:1-5:18
• 
  Michael Hanus:
  Semantic Versioning Checking in a Declarative Package Manager. 6:1-6:16
• 
  Daniela Inclezan, Qinglin Zhang, Marcello Balduccini, Ankush Israney:
  Understanding Restaurant Stories Using an ASP Theory of Intentions. 7:1-7:4
• 
  Rolf Schwitter:
  Learning Effect Axioms via Probabilistic Logic Programming. 8:1-8:15
• 
  Nataliia Stulova, José F. Morales, Manuel V. Hermenegildo:
  Towards Run-time Checks Simplification via Term Hiding. 9:1-9:3
• 
  Paul Tarau:
  A Hitchhiker's Guide to Reinventing a Prolog Machine. 10:1-10:16
• 
  Neng-Fa Zhou, Roman Barták:
  // Efficient Declarative Solutions in Picat for Optimal Multi-Agent Pathfinding. 11:1-11:2
• 
  Bernhard Bliem:
  Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs. 12:1-12:12
• 
  Tiantian Gao:
  Achieving High Quality Knowledge Acquisition using Controlled Natural Language. 13:1-13:10
• 
  Jason Hemann, Daniel P. Friedman, William E. Byrd, Matthew Might:
  A Simple Complete Search for Logic Programming. 14:1-14:8
• 
  Nataliia Stulova:
  On Improving Run-time Checking in Dynamic Languages. 15:1-15:10

a service of  

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-04-22 20:01 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: