The SCEAS System
Navigation Menu

Conferences in DBLP

APPIA-GULP-PRODE (agp)
1999 (conf/agp/1999)

  1. 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]
  2. Floriano Zini, Leon Sterling
    Designing Ontologies for Agents. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:29-42 [Conf]
  3. Fernando Orejas, Elvira Pino
    Semantic Definitions for Normal Open Programs. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:43-58 [Conf]
  4. Andrea Formisano
    Proving the completeness of theory-based variants of resolution. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:59-74 [Conf]
  5. 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]
  6. 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]
  7. Antonio J. Fernández, Patricia M. Hill
    Constraint Solving on Lattices. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:105-120 [Conf]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. Roberta Gori, Giorgio Levi
    On the verification of finite failure. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:197-212 [Conf]
  14. Roberto Bagnara, Enea Zaffanella, Patricia M. Hill
    Enhancing Sharing for Precision. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:213-228 [Conf]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. Agostino Dovier, Carla Piazza, Enrico Pontelli, Gianfranco Rossi
    ACI1 constraints. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:305-320 [Conf]
  21. Patricia M. Hill, Fausto Spoto
    Freeness Analysis through Linear Refinement. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:321-337 [Conf]
  22. 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]
  23. Pedro Cabalar
    Temporal Answer Sets. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:351-366 [Conf]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. Fabio Fioravanti, Maurizio Proietti
    Contextual Specialization of Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:455-470 [Conf]
  31. 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]
  32. Pablo López, Ernesto Pimentel
    Hypothetical Reasoning with Substructural Logics. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:485-496 [Conf]
  33. 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]
  34. Luís Soares Barbosa
    Prototyping Processes. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:513-528 [Conf]
  35. Roberta Gori
    A fixpoint semantics for reasoning about finite failure. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:529-544 [Conf]
  36. 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]
  37. Enea Zaffanella, Roberto Bagnara, Patricia M. Hill
    Widening Sharing. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:559-574 [Conf]
  38. 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]
  39. Carlos Viegas Damásio, V. Beires Nogueira
    Negation in Transaction Programs. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:589-604 [Conf]
  40. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002