![](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 29 matches
- 2011
- Mario Alviano
, Wolfgang Faber
:
Dynamic Magic Sets and super-coherent answer set programs. AI Commun. 24(2): 125-145 (2011) - Josep Argelich
:
Max-SAT formalisms with hard and soft constraints. AI Commun. 24(1): 101-103 (2011) - Jorge A. Baier:
Planning with rich goals, preferences and procedural operators via reformulation. AI Commun. 24(4): 347-348 (2011) - Marcello Balduccini:
Learning and using domain-specific heuristics in ASP solvers. AI Commun. 24(2): 147-164 (2011) - Marcello Balduccini, Stefan Woltran:
Special issue on answer set programming. AI Commun. 24(2): 105-106 (2011) - Montserrat Batet
:
Ontology-based semantic clustering. AI Commun. 24(3): 291-292 (2011) - Pedro Cabalar:
A logical characterisation of ordered disjunction. AI Commun. 24(2): 165-175 (2011) - Francesco Calimeri
, Susanna Cozza, Giovambattista Ianni, Nicola Leone
:
Finitely recursive programs: Decidability and bottom-up computation. AI Commun. 24(4): 311-334 (2011) - Roberto Carbone
:
LTL model-checking for security protocols. AI Commun. 24(3): 281-283 (2011) - Luca Console, Ilaria Lombardi, Claudia Picardi, Rossana Simeoni:
Toward a social web of intelligent things. AI Commun. 24(3): 265-279 (2011) - Martin C. Cooper
, Marie de Roquemaurel, Pierre Régnier:
A weighted CSP approach to cost-optimal planning. AI Commun. 24(1): 1-29 (2011) - Natalia Criado
, Estefania Argente
, Vicente J. Botti
:
Open issues for normative multi-agent systems. AI Commun. 24(3): 233-264 (2011) - Marcos Aurélio Domingues
:
Exploiting multidimensional data for web site automation. AI Commun. 24(3): 289-290 (2011) - Christian Drescher, Oana Tifrea, Toby Walsh:
Symmetry-breaking answer set solving. AI Commun. 24(2): 177-194 (2011) - Alberto Freitas
:
Building cost-sensitive decision trees for medical applications. AI Commun. 24(3): 285-287 (2011) - Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub
, Marius Schneider
:
Potassco: The Potsdam Answer Set Solving Collection. AI Commun. 24(2): 107-124 (2011) - Martin Gebser, Orkunt Sabuncu, Torsten Schaub
:
An incremental answer set programming based system for finite model computation. AI Commun. 24(2): 195-212 (2011) - Michael Katz:
Implicit abstraction heuristics for cost-optimal planning. AI Commun. 24(4): 343-345 (2011) - Francisco Martínez-Álvarez
:
Clustering preprocessing to improve time series forecasting. AI Commun. 24(1): 97-98 (2011) - Pasquale De Meo, Antonino Nocera, Domenico Rosaci, Domenico Ursino:
Recommendation of reliable users, social networks and high-quality resources in a Social Internetworking System. AI Commun. 24(1): 31-50 (2011) - Amin Nikanjam
, Hadi Sharifi, Adel Torkaman Rahmani:
Efficient model building in competent genetic algorithms using DSM clustering. AI Commun. 24(3): 213-231 (2011) - Leander Schietgat:
Graph-based data mining for biological applications. AI Commun. 24(1): 95-96 (2011) - Axel J. Soto
:
On the use of machine learning methods for modern drug discovery. AI Commun. 24(1): 99-100 (2011) - Siddharth Srivastava:
Foundations and applications of generalized planning. AI Commun. 24(4): 349-351 (2011) - Geoff Sutcliffe
:
The 5th IJCAR automated theorem proving system competition - CASC-J5. AI Commun. 24(1): 75-89 (2011) - Omkar J. Tilak, Snehasis Mukhopadhyay:
Partially decentralized reinforcement learning in finite, multi-agent Markov decision processes. AI Commun. 24(4): 293-309 (2011) - Cristina Urdiales:
The bare necessities: Adaptive assistance for wheelchair control. AI Commun. 24(4): 337-339 (2011) - Xiaofang Wang, Nicola Policella, Stephen F. Smith, Angelo Oddi
:
Constraint-based methods for scheduling discretionary services. AI Commun. 24(1): 51-73 (2011) - Johan Wittocx:
Finite domain and symbolic inference methods for extensions of first-order logic. AI Commun. 24(1): 91-93 (2011)
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-01 03:26 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