![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
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 30 matches
- 2000
- Eyal Amir, Sheila A. McIlraith:
Improving the Efficiency of Reasoning Through Structure-Based Reformulation. SARA 2000: 247-259 - Stefano Bistarelli
, Philippe Codognet, Francesca Rossi:
An Abstraction Framework for Soft Constraints and Its Relationship with Constraint Propagation. SARA 2000: 71-86 - Isabelle Bournaud
, Mélanie Courtine
, Jean-Daniel Zucker:
Abstractions for Knowledge Organization of Relational Descriptions. SARA 2000: 87-106 - Carlos Carreras
, Manuel V. Hermenegildo:
Grid-Based Histogram Arithmetic for the Probabilistic Analysis of Functions. SARA 2000: 107-123 - Rui Chen, Min Ouyang, Peter Z. Revesz:
Approximating Data in Constraint Databases. SARA 2000: 124-143 - Rada Chirkova, Michael R. Genesereth:
Linearly Bounded Reformulations of Unary Databases. SARA 2000: 144-163 - Patrick Cousot:
Partial Completeness of Abstract Fixpoint Checking. SARA 2000: 1-25 - Thomas G. Dietterich:
An Overview of MAXQ Hierarchical Reinforcement Learning. SARA 2000: 26-44 - Thomas Ellman:
Program Synthesis and Transformation Techniques for Simulation, Optimization, and Constraint Satisfaction. SARA 2000: 317-319 - Jeremy Frank, Ari K. Jónsson, Paul H. Morris:
On Reformulating Planning as Dynamic Constraint Satisfaction. SARA 2000: 271-280 - Terrence P. Fries, James H. Graham:
An Agent-Based Approach to Robust Switching Between Abstraction Levels for Fault Diagnosis. SARA 2000: 303-308 - David Furcy:
Using and Learning Abstraction Hierarchies for Planning. SARA 2000: 320-321 - Lise Getoor:
Learning Probabilistic Relational Models. SARA 2000: 322-323 - István T. Hernádvölgyi, Robert C. Holte:
Experiments with Automatically Created Memory-Based Heuristics. SARA 2000: 281-290 - Richard E. Korf:
Recent Progress in the Design and Analysis of Admissible Heuristic Functions. SARA 2000: 45-55 - T. K. Satish Kumar:
A Compositional Approach to Causality. SARA 2000: 309-312 - T. K. Satish Kumar:
Synergy between Compositional Modeling and Bayesian Networks. SARA 2000: 324-325 - Christophe Lecoutre, Sylvain Merchez, Frédéric Boussemart, Éric Grégoire:
A CSP Abstraction Framework. SARA 2000: 164-184 - Christophe Lecoutre, Sylvain Merchez, Frédéric Boussemart, Éric Grégoire:
A CSP Abstraction Framework. SARA 2000: 326-327 - Chen Li:
Answering Queries with Database Restrictions. SARA 2000: 328-329 - Gordon S. Novak Jr.:
Interactions of Abstractions in Programming. SARA 2000: 185-201 - Gordon S. Novak Jr.:
Research Summary. SARA 2000: 330-331 - Yoshiaki Okubo, Makoto Haraguchi, Yan Fang Zheng:
A Method for Finding Consistent Hypotheses Using Abstraction. SARA 2000: 313-316 - Peter Z. Revesz:
Reformulation and Approximation in Model Checking. SARA 2000: 202-218 - Lorenza Saitta, Jean-Daniel Zucker:
Abstraction and Phase Transitions in Relational Learning. SARA 2000: 291-302 - Stefano Spaccapietra, Christine Parent, Christelle Vangenot:
GIS Databases: From Multiscale to MultiRepresentation. SARA 2000: 57-70 - William T. B. Uther, Manuela M. Veloso:
The Lumberjack Algorithm for Learning Linked Decision Forests. SARA 2000: 219-232 - Toby Walsh:
Reformulating Propositional Satisfiability as Constraint Satisfaction. SARA 2000: 233-246 - Marie desJardins, Lise Getoor, Daphne Koller:
Using Feature Hierarchies in Bayesian Network Learning. SARA 2000: 260-270 - Berthe Y. Choueiry, Toby Walsh:
Abstraction, Reformulation, and Approximation, 4th International Symposium, SARA 2000, Horseshoe Bay, Texas, USA, July 26-29, 2000, Proceedings. Lecture Notes in Computer Science 1864, Springer 2000, ISBN 3-540-67839-5 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-07-03 09:41 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