Logic programming. 19th international conference, ICLP 2003, Mumbai, India, December 9--13, 2003. Proceedings
The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 0993.00051). Indexed articles: \textit{Ridoux, Olivier}, Logic information systems for logic programmers., 3-19 [Zbl 1204.68254] \textit{Winsborough, William H.}, A logic programming view of authorization in distributed systems., 20-46 [Zbl 1204.68064] \textit{Valencia, Frank D.}, Concurrency, time, and constraints., 72-101 [Zbl 1204.68138] \textit{Bruscoli, Paola; Guglielmi, Alessio}, A tutorial on proof theoretic foundations of logic programming., 109-127 [Zbl 1204.68050] \textit{Farré, Carles; Teniente, Ernest; Urpí, Toni}, Handling existential derived predicates in view updating., 148-162 [Zbl 1204.68081] \textit{Eiter, Thomas; Fink, Michael; Greco, Gianluigi; Lembo, Domenico}, Efficient evaluation of logic programs for querying data integration systems., 163-177 [Zbl 1204.68080] \textit{Pradhan, Shekhar}, Argumentation databases., 178-193 [Zbl 1204.68084] \textit{Van Nieuwenborgh, Davy; Vermeir, Dirk}, Order and negation as failure., 194-208 [Zbl 1204.68062] \textit{Lonc, Zbigniew; Truszczyński, Mirosław}, Computing minimal models, stable models, and answer sets., 209-223 [Zbl 1204.68057] \textit{Eiter, Thomas; Fink, Michael}, Uniform equivalence of logic programs under the stable model semantics., 224-238 [Zbl 1204.68052] \textit{Zhao, Yuting; Lin, Fangzhen}, Answer set programming phase transition: a study on randomly generated programs., 239-253 [Zbl 1204.68066] \textit{Lagoon, Vitaly; Mesnard, Fred; Stuckey, Peter J.}, Termination analysis with types is more accurate., 254-268 [Zbl 1204.68054] \textit{Langevine, Ludovic; Ducassé, Mireille; Deransart, Pierre}, A propagation tracer for GNU-Prolog: from formal definition to efficient implementation., 269-283 [Zbl 1204.68055] \textit{Dovier, A.; Pontelli, E.; Rossi, G.}, Intensional sets in CLP., 284-299 [Zbl 1204.68051] \textit{Granvilliers, Laurent; Monfroy, Eric}, Implementing constraint propagation by composition of reductions., 300-314 [Zbl 1204.68197] \textit{King, Andy; Lu, Lunjin}, Forward versus backward verification of logic programs., 315-330 [Zbl 1204.68053] \textit{Wielemaker, Jan}, Native preemptive threads in SWI-Prolog., 331-345 [Zbl 1204.68063] \textit{Wu, Y.; Pontelli, E.; Ranjan, D.}, On the complexity of dependent and-parallelism in logic programming., 361-376 [Zbl 1204.68065] \textit{Pientka, Brigitte}, Higher-order substitution tree indexing., 377-391 [Zbl 1204.68060] \textit{Saha, Diptikalyan; Ramakrishnan, C. R.}, Incremental evaluation of tabled logic programs., 392-406 [Zbl 1204.68061] \textit{Lopes, Ricardo; Costa, Vítor Santos; Silva, Fernando}, On deterministic computations in the extended Andorra model., 407-421 [Zbl 1204.68058] \textit{Valencia, Frank D.}, Timed concurrent constraint programming: Decidability results and their application to LTL., 422-437 [Zbl 1204.68139] \textit{Smaus, Jan-Georg}, Is there an optimal generic semantics for first-order equations?, 438-450 [Zbl 1204.68127] \textit{Lee, Joohyung; Lifschitz, Vladimir}, Loop formulas for disjunctive logic programs., 451-465 [Zbl 1204.68056] \textit{Loyer, Yann; Straccia, Umberto}, Default knowledge in logic programs with uncertainty., 466-480 [Zbl 1204.68059]
scientific article; zbMATH DE number 2025866