L’Aquila, Italy 6-9 September, 1999
Program chairs: Maria Chiara Meo, Manuel Vilares Ferro
Accepted papers (from DBLP): XIV. VI APPIA-GULP-PRODE (1999)
- Maurizio Martelli, Viviana Mascardi, Floriano Zini. Specification and Simulation of Multi-Agent Systems in CaseLP. pages 13-28
- Floriano Zini, Leon Sterling. Designing Ontologies for Agents. pages 29-42
- Fernando Orejas, Elvira Pino. Semantic Definitions for Normal Open Programs. pages 43-58
- Andrea Formisano. Proving the completeness of theory-based variants of resolution. pages 59-74
- María Alpuente, Salvador Lucas, Santiago Escobar. An Incremental Needed Narrowing Calculus for Curry. pages 75-88
- Francisco Javier López-Fraguas, Jaime Sánchez-Hernández. Disequalities May Help to Narrow. pages 89-104
- Antonio J. Fernández, Patricia M. Hill. Constraint Solving on Lattices. pages 105-120
- Stefano Bistarelli, Philippe Codognet, Yan Georget, Fabio Rossi. Labeling and Partial Arc Consistency for Soft Constraints. pages 121-136
- Antonio J. Fernández, Patricia M. Hill. Extending clp(FD) by Negative Constraint Solving. pages 137-150
- Agostino Dovier, Carla Piazza, Alberto Policriti. Comparing expressiveness of set constructor symbols. pages 151-166
- Domenico Cantone, Eugenio G. Omodeo, Pietro Ursino. Transitive Venn diagrams with applications to the decision problem in set theory. pages 167-182
- Francesco Ranzato. CPOs as Concrete Domains: Lattices of Abstract Domains and Complements. pages 183-196
- Roberta Gori, Giorgio Levi. On the verification of finite failure. pages 197-212
- Roberto Bagnara, Enea Zaffanella, Patricia M. Hill. Enhancing Sharing for Precision. pages 213-228
- Sergio Flesca, Sergio Greco, P. Lambardi, D. Romeo. A System Prototype for the Optimization of Disjunctive Queries. pages 229-242
- Elisa Bertino, Piero A. Bonatti, Elena Ferrari, Maria Luisa Sapino. Specifying and computing hierarchies of temporal authorizations. pages 243-258
- José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski, Halina Przymusinska, Paulo Quaresma. Preliminary exploration on actions as updates. pages 259-272
- Paola Inverardi, Monica Nesi. Adding sorts to TRSs: a result on modularity of termination. pages 273-288
- José-Luis Ruiz-Reina, José-Antonio Alonso, María-José Hidalgo, Francisco-Jesús Martín-Mateos. Mechanical verification of a rule-based unification algorithm in the Boyer-Moore theorem prover. pages 289-304
- Agostino Dovier, Carla Piazza, Enrico Pontelli, Gianfranco Rossi. ACI1 constraints. pages 305-320
- Patricia M. Hill, Fausto Spoto. Freeness Analysis through Linear Refinement. pages 321-337
- Marco Comini, Wlodzimierz Drabent, Pawel Pietrzak. Diagnosis of CHIP Programs Using Type Information. pages 337-350
- Pedro Cabalar. Temporal Answer Sets. pages 351-366
- Miguel Ferrand, João Alexandre Leite, Amílcar Cardoso. Hypotethical Reasoning: an application to Optical Music Recognition. pages 367-382
- David Lorenzo, Ramón P. Otero. Learning Action Theories as Logic Programs. pages 383-396
- Ferrante Formato, Giangiacomo Gerla, Maria I. Sessa. Extension of Logic Programming by Similarity. pages 397-410
- Marco Gavanelli, Evelina Lamma, Michela Milano, Paola Mello. Domains as First Class Objects in CLP(FD). pages 411-424
- Ricardo Lopes, Vítor Santos Costa. The BEAM: A first EAM Implementation. pages 425-440
- Marco Bertolino, Sandro Etalle, Catuscia Palamidessi. The Replacement Operation for CCP Programs. pages 441-454
- Fabio Fioravanti, Maurizio Proietti. Contextual Specialization of Constraint Logic Programs. pages 455-470
- Antonio Brogi, G. Marongiu. ExpertFinder: A Prolog Recommender System Integrated with the WWW. pages 471-484
- Pablo López, Ernesto Pimentel. Hypothetical Reasoning with Substructural Logics. pages 485-496
- Alberto Momigliano, Frank Pfenning. The Relative Complement Problem for Higher-Order Patterns. pages 497-512
- Luís Soares Barbosa. Prototyping Processes. pages 513-528
- Roberta Gori. A fixpoint semantics for reasoning about finite failure. pages 529-544
- Manuel Vilares Ferro, David Cabrero Souto, Miguel Angel Alonso Pardo. Some questions about non-termination in DCGs. pages 545-558
- Enea Zaffanella, Roberto Bagnara, Patricia M. Hill. Widening Sharing. pages 559-574
- Stefania Costantini, T. Morbidoni. Computational Complexity of a Knowledge Compilation. Approach to the Static Semantics for Disjunctive Logic Programs. pages 575-588
- Carlos Viegas Damásio, V. Beires Nogueira. Negation in Transaction Programs. pages 589-604
- Fosca Giannotti, Giuseppe Manco. Querying inductive Databases via Logic-Based user-defined aggregates. pages 605-620