Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-19T02:12:33.201Z Has data issue: false hasContentIssue false
  • English
  • Français

Introduction to the 27th International Conference on Logic Programming Special Issue

Published online by Cambridge University Press:  06 July 2011

JOHN GALLAGHER  and
MICHAEL GELFOND
JOHN GALLAGHER
Affiliation:
Roskilde University, Denmark and IMDEA Software Institute, Madrid, Spain (e-mail: [email protected])
MICHAEL GELFOND
Affiliation:
Texas Tech University, USA (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Extract

Following the initiative in 2010 taken by the Association for Logic Programming and Cambridge University Press, the full papers accepted for the International Conference on Logic Programming again appear as a special issue of Theory and Practice of Logic Programming (TPLP)—the 27th International Conference on Logic Programming Special Issue. Papers describing original, previously unpublished research and not simultaneously submitted for publication elsewhere were solicited in all areas of logic programming including but not restricted to: Theory: Semantic Foundations, Formalisms, Non- monotonic Reasoning, Knowledge Representation. Implementation: Compilation, Memory Management, Virtual Machines, Parallelism. Environments: Program Analysis, Transformation, Validation, Verification, Debugging, Profiling, Testing. Language Issues: Concurrency, Objects, Coordination, Mobility, Higher Order, Types, Modes, Assertions, Programming Techniques. Related Paradigms: Abductive Logic Programming, Inductive Logic Programming, Constraint Logic Programming, Answer-Set Programming. Applications: Databases, Data Integration and Federation, Software Engineering, Natural Language Processing, Web and Semantic Web, Agents, Artificial Intelligence, Bioinformatics.

Type
Introduction
Information
Theory and Practice of Logic Programming , Volume 11 , Special Issue 4-5: 27th International Conference on Logic Programming , July 2011 , pp. 429 - 432
Copyright
Copyright © Cambridge University Press 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)