Остановите войну!
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 32 matches
- 1998
- Ashraf M. Abdelbar, Gene A. Tagliarini:
Using neural network learning in an Othello evaluation function. J. Exp. Theor. Artif. Intell. 10(2): 217-229 (1998) - Grigoris Antoniou:
A note on the cumulativity of justified default logic. J. Exp. Theor. Artif. Intell. 10(4): 507-509 (1998) - Grigoris Antoniou, Tyrone O'Neill, Joe Thurbon:
Studying properties of classes of default logics. J. Exp. Theor. Artif. Intell. 10(4): 495-505 (1998) - Mark H. Bickhard:
Levels of representationality. J. Exp. Theor. Artif. Intell. 10(2): 179-215 (1998) - Selmer Bringsjord:
Computationalism is dead; now what? J. Exp. Theor. Artif. Intell. 10(4): 393-402 (1998) - Luis M. de Campos:
Independency relationships and learning algorithms for singly connected networks. J. Exp. Theor. Artif. Intell. 10(4): 511-549 (1998) - David Carmel, Shaul Markovitch:
Model-based learning of interaction strategies in multi-agent systems. J. Exp. Theor. Artif. Intell. 10(3): 309-332 (1998) - Jianhua Chen:
A sound and complete proof theory for the generalized logic of only knowing. J. Exp. Theor. Artif. Intell. 10(4): 421-438 (1998) - C. K. Chiu, J. H. M. Lee:
Extending HCLP with partially ordered hierarchies and composite constraints. J. Exp. Theor. Artif. Intell. 10(1): 5-24 (1998) - James H. Fetzer:
People are not computers: (most) thought processes are not computational procedures. J. Exp. Theor. Artif. Intell. 10(4): 371-391 (1998) - Kenneth D. Forbus, Dedre Gentner, Arthur B. Markman, Ronald W. Ferguson:
Analogy just looks like high level perception: why a domain-general approach to analogical mapping is right. J. Exp. Theor. Artif. Intell. 10(2): 231-257 (1998) - Anthony Gillies:
A situation-theoretic account of nonmonotonic reasoning. J. Exp. Theor. Artif. Intell. 10(4): 439-449 (1998) - Robert R. Hoffman:
AI models of verbal/conceptual analogy. J. Exp. Theor. Artif. Intell. 10(2): 259-286 (1998) - Walter Hower:
Introduction to non-standard constraint processing. J. Exp. Theor. Artif. Intell. 10(1): 1-3 (1998) - Walter Hower, Stephan Jacobi:
Constraint updating. J. Exp. Theor. Artif. Intell. 10(1): 25-36 (1998) - Walter Hower, Stephan Jacobi:
Fine-grained conflict resolution in constraint satisfaction problems. J. Exp. Theor. Artif. Intell. 10(1): 37-47 (1998) - Frederik Jan Jüngen, Wojtek Kowalczyk:
Approximate algorithms for generalized maximum utility problems. J. Exp. Theor. Artif. Intell. 10(1): 49-62 (1998) - Maja J. Mataric:
Using communication to reduce locality in distributed multiagent learning. J. Exp. Theor. Artif. Intell. 10(3): 357-369 (1998) - Wolfgang Menzel:
Constraint satisfaction for robust parsing of spoken language. J. Exp. Theor. Artif. Intell. 10(1): 77-89 (1998) - Wady Naanaa, Simone Pimont:
Handling structured and ambiguous constraints in constraint satisfaction problems. J. Exp. Theor. Artif. Intell. 10(1): 91-102 (1998) - Claude Le Pape:
Constraint propagation for ordering, abstraction, and aggregation relations. J. Exp. Theor. Artif. Intell. 10(1): 63-76 (1998) - Armand Prieditis, Evan Fletcher:
Two-agent IDA*. J. Exp. Theor. Artif. Intell. 10(4): 451-485 (1998) - William J. Rapaport:
How minds can be computational systems. J. Exp. Theor. Artif. Intell. 10(4): 403-419 (1998) - Marco Roccetti, Paola Salomoni:
Using Bayesian belief networks for the automated assessment of students' knowledge of geometry problem solving procedures. J. Exp. Theor. Artif. Intell. 10(2): 145-178 (1998) - Francesca Rossi, Alessandro Sperduti:
Learning solution preferences in constraint problems. J. Exp. Theor. Artif. Intell. 10(1): 103-116 (1998) - Sandip Sen, Mahendra Sekaran:
Individual learning of coordination knowledge. J. Exp. Theor. Artif. Intell. 10(3): 333-356 (1998) - Munindar P. Singh:
Semantical considerations on intention dynamics for BDI agents. J. Exp. Theor. Artif. Intell. 10(4): 551-564 (1998) - Gadi Solotorevsky, Solomon Eyal Shimony, Amnon Meisels:
CSPs with counters: a likelihood-based heuristic. J. Exp. Theor. Artif. Intell. 10(1): 117-129 (1998) - José M. Vidal, Edmund H. Durfee:
Learning nested agent models in an information economy. J. Exp. Theor. Artif. Intell. 10(3): 291-308 (1998) - Nigel Ward:
Artificial intelligence and other approaches to speech understanding: reflections on methodology. J. Exp. Theor. Artif. Intell. 10(4): 487-493 (1998)
skipping 2 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-25 20:13 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