Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th ICLP 2003: Mumbai, India
- Catuscia Palamidessi:
Logic Programming, 19th International Conference, ICLP 2003, Mumbai, India, December 9-13, 2003, Proceedings. Lecture Notes in Computer Science 2916, Springer 2003, ISBN 3-540-20642-6
Invited Talks
- J. Gregory Morrisett:
Achieving Type Safety for Low-Level Code. 1-2 - Olivier Ridoux:
Logic Information Systems for Logic Programmers. 3-19 - William H. Winsborough:
A Logic Programming View of Authorization in Distributed Systems. 20-46 - Giorgio Delzanno, Maurizio Gabbrielli
, Maria Chiara Meo:
Compositional Verification of Infinite State Systems. 47-48 - Rolf Backofen, Sebastian Will:
A Constraint-Based Approach to Structure Prediction for Simplified Protein Models That Outperforms Other Existing Methods. 49-71
Invited Tutorials
- Frank D. Valencia:
Concurrency, Time, and Constraints. 72-101 - François Fages:
Symbolic Model-Checking for Biochemical Systems. 102 - Kung-Kiu Lau:
Component-Based Software Development and Logic Programming. 103-108 - Paola Bruscoli, Alessio Guglielmi:
A Tutorial on Proof Theoretic Foundations of Logic Programming. 109-127
Regular Papers
- Salvador Abreu, Daniel Diaz:
Objective: In Minimum Context. 128-147 - Carles Farré, Ernest Teniente, Toni Urpí:
Handling Existential Derived Predicates in View Updating. 148-162 - Thomas Eiter, Michael Fink, Gianluigi Greco, Domenico Lembo:
Efficient Evaluation of Logic Programs for Querying Data Integration Systems. 163-177 - Shekhar Pradhan:
Argumentation Databases. 178-193 - Davy Van Nieuwenborgh, Dirk Vermeir:
Order and Negation as Failure. 194-208 - Zbigniew Lonc, Miroslaw Truszczynski:
Computing Minimal Models, Stable Models, and Answer Sets. 209-223 - Thomas Eiter, Michael Fink:
Uniform Equivalence of Logic Programs under the Stable Model Semantics. 224-238 - Yuting Zhao, Fangzhen Lin:
Answer Set Programming Phase Transition: A Study on Randomly Generated Programs. 239-253 - Vitaly Lagoon, Frédéric Mesnard, Peter J. Stuckey:
Termination Analysis with Types Is More Accurate. 254-268 - Ludovic Langevine, Mireille Ducassé, Pierre Deransart:
A Propagation Tracer for GNU-Prolog: From Formal Definition to Efficient Implementation. 269-283 - Agostino Dovier, Enrico Pontelli, Gianfranco Rossi:
Intensional Sets in CLP. 284-299 - Laurent Granvilliers, Éric Monfroy:
Implementing Constraint Propagation by Composition of Reductions. 300-314 - Andy King, Lunjin Lu:
Forward versus Backward Verification of Logic Programs. 315-330 - Jan Wielemaker:
Native Preemptive Threads in SWI-Prolog. 331-345 - Frej Drejhammar, Christian Schulte, Per Brand, Seif Haridi:
Flow Java: Declarative Concurrency for Java. 346-360 - Yao Wu, Enrico Pontelli, Desh Ranjan:
On the Complexity of Dependent And-Parallelism in Logic Programming. 361-376 - Brigitte Pientka:
Higher-Order Substitution Tree Indexing. 377-391 - Diptikalyan Saha, C. R. Ramakrishnan:
Incremental Evaluation of Tabled Logic Programs. 392-406 - Ricardo Lopes, Vítor Santos Costa, Fernando M. A. Silva:
On Deterministic Computations in the Extended Andorra Model. 407-421 - Frank D. Valencia:
Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL. 422-437 - Jan-Georg Smaus:
Is There an Optimal Generic Semantics for First-Order Equations?. 438-450 - Joohyung Lee, Vladimir Lifschitz:
Loop Formulas for Disjunctive Logic Programs. 451-465 - Yann Loyer, Umberto Straccia:
Default Knowledge in Logic Programs with Uncertainty. 466-480
Posters
- Jesús Correas, José M. Gómez, Manuel Carro, Daniel Cabeza Gras, Manuel V. Hermenegildo:
A Generic Persistence Model for (C)LP Systems. 481-482 - Selim T. Erdogan, Vladimir Lifschitz:
Definitions in Answer Set Programming: (Extended Abstract). 483-484 - Hai-Feng Guo, Gopal Gupta:
A New Mode Declaration for Tabled Predicates. 485-486 - Kwanho Jung, Hyunjang Kong, Junho Choi, Yoo-Jin Moon, Pankoo Kim:
Adding the Temporal Relations in Semantic Web Ontologies. 487-488 - M. R. K. Krishna Rao:
Polynomial-Time Learnability from Entailment. 489-491 - Yoo-Jin Moon, Kyongho Min, Youngho Hwang, Pankoo Kim:
Integration of Semantic Networks for Corpus-Based Word Sense Disambiguation. 492-493 - Alexei A. Morozov:
Development and Application of Logical Actors Mathematical Apparatus for Logic Programming of Web Agents. 494-495 - Susana Muñoz-Hernández, Juan José Moreno-Navarro:
A Real Implementation for Constructive Negation. 496-497 - Kaninda Musumbu:
Simulating Security Systems Based on Logigrams. 498-499 - Giridhar Pemmasani, Hai-Feng Guo, Yifei Dong, C. R. Ramakrishnan, I. V. Ramakrishnan:
Online Justification for Tabled Logic Programs. 500-501 - Rafael Ramírez:
Inducing Musical Rules with ILP. 502-504 - David A. Rosenblueth:
A Distinct-Head Folding Rule. 505-506 - Alexander Serebrenik:
Termination Analysis of Logic Programs: Extended Abstract. 507-508 - Alexander Serebrenik, Bart Demoen:
Refactoring Logic Programs: Extended Abstract. 509-510 - Jan-Georg Smaus:
Termination of Logic Programs for Various Dynamic Selection Rules. 511-512 - Tran Cao Son, Enrico Pontelli:
Adding Preferences to Answer Set Planning. 513-514 - Michael Thielscher:
Controlling Semi-automatic Systems with FLUX. 515-516 - Kazunori Ueda, Norio Kato:
The Language Model LMNtal. 517-518
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.
last updated on 2024-04-17 20:29 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:
