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