Остановите войну!
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 24 matches
- 2013
- Amir Aavani, David G. Mitchell, Eugenia Ternovska:
New Encoding for Translating Pseudo-Boolean Constraints into SAT. SARA 2013 - Maher A. Alhossaini, J. Christopher Beck:
Instance-Specific Remodelling of Planning Domains by Adding Macros and Removing Operators. SARA 2013 - J. Christopher Beck:
Modeling, Global Constraints, and Decomposition. SARA 2013 - Christian Bessiere, Zeynep Kiziltan, Andrea Rappini, Toby Walsh:
A Framework for Combining Set Variable Representations. SARA 2013 - Lukás Chrpa, Mauro Vallati, Thomas Leo McCluskey:
Determining Linearity of Optimal Plans by Operator Schema Analysis. SARA 2013 - Lukás Chrpa, Mauro Vallati, Thomas Leo McCluskey, Diane E. Kitchin:
Generating Macro-Operators by Exploiting Inner Entanglements. SARA 2013 - Filip Dvorak, Daniel Toropila, Roman Barták:
Towards AI Planning Efficiency: Finite-Domain State Variable Reformulation. SARA 2013 - Robert C. Holte:
Korf's Conjecture and the Future of Abstraction-Based Heuristics. SARA 2013 - Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs:
Adding New Bi-Asserting Clauses for Faster Search in Modern SAT Solvers. SARA 2013 - T. K. Satish Kumar, Marcello Cirillo, Sven Koenig:
On the Traveling Salesman Problem with Simple Temporal Constraints. SARA 2013 - T. K. Satish Kumar, Liron Cohen, Sven Koenig:
Incorrect Lower Bounds for Path Consistency and More. SARA 2013 - T. K. Satish Kumar, Liron Cohen, Sven Koenig:
Submodular Constraints and Planar Constraint Networks: New Results. SARA 2013 - Ashique Rupam Mahmood, Richard S. Sutton:
Position Paper: Representation Search through Generate and Test. SARA 2013 - Abhijeet Mohapatra, Michael R. Genesereth:
Reformulating Aggregate Queries Using Views. SARA 2013 - Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:
Microstructures for CSPs with Constraints of Arbitrary Arity. SARA 2013 - Mehdi Sadeqi, Robert C. Holte, Sandra Zilles:
Using Coarse State Space Abstractions to Detect Mutex Pairs. SARA 2013 - Lorenza Saitta:
Abstraction: A Historical and Interdisciplinary Perspective. SARA 2013 - Harm van Seijen, Shimon Whiteson, Leon J. H. M. Kester:
Efficient Abstraction Selection in Reinforcement Learning (Extended Abstract). SARA 2013 - Nathan R. Sturtevant:
External Memory PDBs: Initial Results. SARA 2013 - Pavel Surynek:
Optimal Cooperative Path-Finding with Generalized Goals in Difficult Cases. SARA 2013 - SARA 2013 Organization. SARA 2013
- Preface. SARA 2013
- Past SARA Symposia. SARA 2013
- Alan M. Frisch, Peter Gregory:
Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, SARA 2013, 11-12 July 2013, Leavenworth, Washington, USA. AAAI 2013, ISBN 978-1-57735-630-1 [contents]
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-06-29 15:47 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