Abstract is missing.
- Systematic design of abstract interpretationsRoberto Giacobazzi. 1-4
- Rewriting logic and its applicationsNarciso Martí-Oliet. 5-8
- A Unified Computation Model for Declarative ProgrammingMichael Hanus. 9-24
- High Performance Parallel Logic Programming: The ACE Parallel Prolog SystemGopal Gupta, Enrico Pontelli. 25-32
- Intuitionistic Implication in Abstract InterpretationRoberto Giacobazzi, Francesca Scozzari. 33-44
- Quasi-metric Spaces as Domains for Abstract InterpretationFederico Crazzolara. 45-56
- A Semantic Framework for the Analysis of Concurrent Constraint ProgrammingR. Moreno. 57-68
- Sharing RevisitedRoberto Bagnara, Patricia M. Hill, Enea Zaffanella. 69-80
- Structural Information Analysis for CLP LanguagesRoberto Bagnara. 81-92
- Set domains for structural properties of termsAgostino Dovier, Alberto Policriti. 93-104
- A Linear Logic Semantics for Object-Oriented, Deductive and Active DatabasesMarco Bozzano, Giorgio Delzanno, Maurizio Martelli. 105-116
- Integrating Active Rules in U-DatalogVincenzo Gervasi, Alessandra Raffaetà. 117-128
- A Deductive Data Model for Representing and Querying Semistructured DataFosca Giannotti, Giuseppe Manco, Dino Pedreschi. 129-140
- The Architecture of a Disjunctive Deductive Database SystemThomas Eiter, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, Francesco Scarcello. 141-152
- Gramáticas Datalog Extendidas: Una Nueva AproximaciónLidia Moreno, Manuel Palomar, Antonio Molina. 153-162
- Concurrent Smart Evaluation of Datalog QueriesJosé Francisco Aldana Montes, José M. Troya. 163-174
- Properties of the Lattice of Observables in Logic ProgrammingG. Amato, G. Levi. 175-188
- Automated Behavioural Verification of Prolog ProgramsBaudouin Le Charlier, Christophe Leclère, Sabina Rossi, Agostino Cortesi. 189-200
- A Denotational Semantics for PrologFausto Spoto, Giorgio Levi. 201-212
- High-level Parallel and Concurrent Programming in EdenSilvia Breitinger, Rita Loogen, Yolanda Ortega-Mallén, Ricardo Peña-Marí. 213-224
- On Probabilistic CCPAlessandra Di Pierro, Herbert Wiklicky. 225-234
- Semantics and Expressive Power of a Timed Concurrent Constraint LanguageFrank S. de Boer, Maurizio Gabbrielli, Maria Chiara Meo. 235-246
- A Lazy Splitting System for ForumPablo López, Ernesto Pimentel. 247-258
- Semantics for Modules in Functional-Logic ProgrammingJuan M. Molina-Bravo, Ernesto Pimentel. 259-270
- A Monotonic Declarative Semantics for Normal Logic ProgramsPaqui Lucio, Fernando Orejas, Elvira Pino. 271-282
- A Constructive Negation for Transition System SpecificationsPiero A. Bonatti. 283-294
- An Algorithm for Learning Abductive RulesEvelina Lamma, Paola Mello, Michela Milano, Fabrizio Riguzzi. 295-306
- An Approach to Infinite Terms Traversal in DCGsManuel Vilares Ferro, David Cabrero Souto, Miguel Angel Alonso Pardo. 307-318
- A Fuzzy Logic Programming LanguageFrancesca Arcelli Fontana, Ferrante Formato. 319-332
- Datalog and Description Logics: Expressive PowerMarco Cadoli, Luigi Palopoli, Maurizio Lenzerini. 333-344
- Verification of Progress PropertiesZohar Manna. 345-346
- Safe Folding/Unfolding with Conditional NarrowingMaría Alpuente, Moreno Falaschi, Ginés Moreno, Germán Vidal. 347-358
- Parsing TAGs with PrologVíctor J. Díaz Madrigal, M. Toro Bonilla. 359-368
- Using Reflection to Specify Transaction Sequences in Rewriting LogicIsabel Pita, Narciso Martí-Oliet. 369-380
- Action Specifications in logAlessandro Provetti, G. Rossi. 381-392
- Computational Properties of Term Rewriting with Replacement RestrictionsSalvador Lucas. 393-404
- Global Skolemization with Grouped QuantifiersDomenico Cantone, Marianna Nicolosi Asmundo, Eugenio G. Omodeo. 405-414
- Internet Credential Acceptance PoliciesKent E. Seamons, William H. Winsborough, Marianne Winslett. 415-432
- On the Relationship between Logic Programs and SpecificationsKung-Kiu Lau, Mario Ornaghi. 433-444
- An Efficient Algorithm for Recognizing the Forward-Branching Class of Term-Rewriting SystemsAlain Miniussi, Robert Strandh. 445-456
- On T Logic ProgrammingAgostino Dovier, Andrea Formisano, Alberto Policriti. 457-466
- Dealing with Infinite Intensional Sets in CLPR. Carmona, Agostino Dovier, Gianfranco Rossi. 465-478
- Intensional Set ConstraintsGilles Richard, Frédéric Saubion, A. Tellez-Arenas. 479-490
- Applying Logic Programming to the Specification of Complex ApplicationsMaurizio Martelli, Viviana Mascardi, Floriano Zini. 491-500
- Transport Primitives for Functional AgentsVíctor M. Gulías, Juan J. Quintela, José Luis Freire. 501-510
- Formal Specification of a Scanning Tunnelling MicroscopeJoaquín Nicolás, Juan Alcalde, José Ambrosio Toval Álvarez, Aurelio Arenas. 511-522
- Slot Unification GrammarAntonio Ferrández, Manuel Palomar, Lidia Moreno. 523-532
- Boolean and Finite Domain Solvers Compared Using Self Referential QuizzesAntonio J. Fernández, Patricia M. Hill. 533-544
- A Semantic Basis for Termination Analysis of Logic Programs and its Realization Using Symbolic Norm ConstraintsMichael Codish, Cohavit Taboch. 545-556
- Adding Weak Constraints to Disjunctive DatalogFrancesco Buccafurri, Nicola Leone, Pasquale Rullo. 557-568