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