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

• 
  Manuel V. Hermenegildo, Torsten Schaub:
  Technical Communications of the 26th International Conference on Logic Programming, ICLP 2010, July 16-19, 2010, Edinburgh, Scotland, UK. LIPIcs 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2010, ISBN 978-3-939897-17-0

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

• 
  Manuel V. Hermenegildo, Torsten Schaub:
  Titlepage, Table of Contents, Conference Organization.
• 
  Manuel V. Hermenegildo, Torsten Schaub:
  Introduction to the Technical Communications of the 26th International Conference on Logic Programming.
• 
  Molham Aref:
  Datalog for Enterprise Software: from Industrial Applications to Research (Invited Talk). 1
• 
  François Fages:
  A Logical Paradigm for Systems Biology (Invited Talk). 2-3
• 
  Marco Alberti, Marco Gavanelli, Evelina Lamma:
  Runtime Addition of Integrity Constraints in an Abductive Proof Procedure. 4-13
• 
  Marcello Balduccini:
  Learning Domain-Specific Heuristics for Answer Set Solvers. 14-23
• 
  Selen Basol, Ozan Erdem, Michael Fink, Giovambattista Ianni:
  HEX Programs with Action Atoms. 24-33
• 
  Kim Bauters, Jeroen Janssen, Steven Schockaert, Dirk Vermeir, Martine De Cock:
  Communicating Answer Set Programs. 34-43
• 
  Stefan Brass:
  Implementation Alternatives for Bottom-Up Evaluation. 44-53
• 
  Domenico Corapi, Alessandra Russo, Emil Lupu:
  Inductive Logic Programming as Abductive Search. 54-63
• 
  Timur Fayruzov, Jeroen Janssen, Dirk Vermeir, Chris Cornelis, Martine De Cock:
  Efficient Solving of Time-dependent Answer Set Programs. 64-73
• 
  Daan Fierens:
  Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization. 74-83
• 
  Nicolas Guenot:
  Focused Proof Search for Linear Logic in the Calculus of Structures. 84-93
• 
  Tomi Janhunen:
  Sampler Programs: The Stable Model Semantics of Abstract Constraint Programs Revisited. 94-103
• 
  Pedro López-García, Luthfi Darmawan, Francisco Bueno:
  A Framework for Verification and Debugging of Resource Usage Properties: Resource Usage Verification. 104-113
• 
  Michael J. Maher:
  Contractibility and Contractible Approximations of Soft Global Constraints. 114-123
• 
  Theofrastos Mantadelis, Gerda Janssens:
  Dedicated Tabling for a Probabilistic Setting. 124-133
• 
  Luís Moniz Pereira, Alexandre Miguel Pinto:
  Tight Semantics for Logic Programs. 134-143
• 
  Joseph P. Near:
  From Relational Specifications to Logic Programs. 144-153
• 
  Johannes Oetsch, Jörg Pührer, Hans Tompits:
  Methods and Methodologies for Developing Answer-Set Programs - Project Description. 154-161
• 
  Fabrizio Riguzzi, Terrance Swift:
  Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions. 162-171
• 
  Jose Santos, Stephen H. Muggleton:
  Subsumer: A Prolog theta-subsumption engine. 172-181
• 
  Paulo Shakarian, V. S. Subrahmanian, Maria Luisa Sapino:
  Using Generalized Annotated Programs to Solve Social Network Optimization Problems. 182-191
• 
  Gerardo I. Simari, V. S. Subrahmanian:
  Abductive Inference in Probabilistic Logic Programs. 192-201
• 
  Christoph Wernhard:
  Circumscription and Projection as Primitives of Logic Programming. 202-211
• 
  Neda Saeedloei, Gopal Gupta:
  Timed Definite Clause Omega-Grammars. 212-221
• 
  Abdulla Alqaddoumi:
  Towards a Parallel Virtual Machine for Functional Logic Programming. 222-225
• 
  Mario Alviano:
  Dynamic Magic Sets for Disjunctive Datalog Programs. 226-235
• 
  Andrés A. Aristizábal P.:
  Bisimilarity in Concurrent Constraint Programming. 236-240
• 
  Celine Dandois:
  Program analysis for code duplication in logic programs. 241-247
• 
  Romain Demeyer:
  Program Analysis to Support Concurrent Programming in Declarative Languages. 248-254
• 
  Christian Drescher:
  Constraint Answer Set Programming Systems. 255-264
• 
  Sarah Alice Gaggl:
  Towards a General Argumentation System based on Answer-Set Programming. 265-269
• 
  Hugo A. López:
  Models for Trustworthy Service and Process Oriented Systems. 270-276
• 
  Thierry Martinez:
  Design and Implementation of a Concurrent Logic Programming Language with Linear Logic Constraints. 277-280
• 
  Niels Pahlavi:
  Higher-order Logic Learning and lambda-Progol. 281-285
• 
  Fabio Parisini:
  Local Branching in a Constraint Programming Framework. 286-288
• 
  Neda Saeedloei:
  Logic Programming Foundations of Cyber-Physical Systems. 289-293
• 
  Zachary Snow:
  Realizing the Dependently Typed Lambda Calculus. 294-299
• 
  Mauricio Toro-Bermúdez:
  Structured Interactive Musical Scores. 300-302
• 
  Jakob Zwirchmayr:
  Cutting-Edge Timing Analysis Techniques. 303-305

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: