Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 41 matches
- 1999
- 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 - María Alpuente, Salvador Lucas, Santiago Escobar:
An Incremental Needed Narrowing Calculus for Curry. APPIA-GULP-PRODE 1999: 75-88 - Roberto Bagnara, Enea Zaffanella, Patricia M. Hill:
Enhancing Sharing for Precision. APPIA-GULP-PRODE 1999: 213-228 - Luís Soares Barbosa:
Prototyping Processes. APPIA-GULP-PRODE 1999: 513-528 - Elisa Bertino, Piero A. Bonatti, Elena Ferrari, Maria Luisa Sapino:
Specifying and computing hierarchies of temporal authorizations. APPIA-GULP-PRODE 1999: 243-258 - Marco Bertolino, Sandro Etalle, Catuscia Palamidessi:
The Replacement Operation for CCP Programs. APPIA-GULP-PRODE 1999: 441-454 - Stefano Bistarelli, Philippe Codognet, Yan Georget, Fabio Rossi:
Labeling and Partial Arc Consistency for Soft Constraints. APPIA-GULP-PRODE 1999: 121-136 - Antonio Brogi, G. Marongiu:
ExpertFinder: A Prolog Recommender System Integrated with the WWW. APPIA-GULP-PRODE 1999: 471-484 - Pedro Cabalar:
Temporal Answer Sets. APPIA-GULP-PRODE 1999: 351-366 - 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 - Marco Comini, Wlodzimierz Drabent, Pawel Pietrzak:
Diagnosis of CHIP Programs Using Type Information. APPIA-GULP-PRODE 1999: 337-350 - 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 - Agostino Dovier, Carla Piazza, Alberto Policriti:
Comparing expressiveness of set constructor symbols. APPIA-GULP-PRODE 1999: 151-166 - Agostino Dovier, Carla Piazza, Enrico Pontelli, Gianfranco Rossi:
ACI1 constraints. APPIA-GULP-PRODE 1999: 305-320 - Antonio J. Fernández, Patricia M. Hill:
Constraint Solving on Lattices. APPIA-GULP-PRODE 1999: 105-120 - Antonio J. Fernández, Patricia M. Hill:
Extending clp(FD) by Negative Constraint Solving. APPIA-GULP-PRODE 1999: 137-150 - Miguel Ferrand, João Alexandre Leite, Amílcar Cardoso:
Hypotethical Reasoning: an application to Optical Music Recognition. APPIA-GULP-PRODE 1999: 367-382 - Manuel Vilares Ferro, David Cabrero Souto, Miguel Angel Alonso Pardo:
Some questions about non-termination in DCGs. APPIA-GULP-PRODE 1999: 545-558 - Fabio Fioravanti, Maurizio Proietti:
Contextual Specialization of Constraint Logic Programs. APPIA-GULP-PRODE 1999: 455-470 - Sergio Flesca, Sergio Greco, P. Lambardi, D. Romeo:
A System Prototype for the Optimization of Disjunctive Queries. APPIA-GULP-PRODE 1999: 229-242 - Ferrante Formato, Giangiacomo Gerla, Maria I. Sessa:
Extension of Logic Programming by Similarity. APPIA-GULP-PRODE 1999: 397-410 - Andrea Formisano:
Proving the completeness of theory-based variants of resolution. APPIA-GULP-PRODE 1999: 59-74 - Marco Gavanelli, Evelina Lamma, Michela Milano, Paola Mello:
Domains as First Class Objects in CLP(FD). APPIA-GULP-PRODE 1999: 411-424 - Fosca Giannotti, Giuseppe Manco:
Querying inductive Databases via Logic-Based user-defined aggregates. APPIA-GULP-PRODE 1999: 605-620 - Roberta Gori:
A fixpoint semantics for reasoning about finite failure. APPIA-GULP-PRODE 1999: 529-544 - Roberta Gori, Giorgio Levi:
On the verification of finite failure. APPIA-GULP-PRODE 1999: 197-212 - Patricia M. Hill, Fausto Spoto:
Freeness Analysis through Linear Refinement. APPIA-GULP-PRODE 1999: 321-337 - Paola Inverardi, Monica Nesi:
Adding sorts to TRSs: a result on modularity of termination. APPIA-GULP-PRODE 1999: 273-288 - Ricardo Lopes, Vítor Santos Costa:
The BEAM: A first EAM Implementation. APPIA-GULP-PRODE 1999: 425-440
skipping 11 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-18 11:18 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint