![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Raul Trejo
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [c6]Christian Espinoza-Carvallo, Raul Trejo:
Factores que Influyen en la Intención de Adopción de elearning en Empresas Venezolanas. AMCIS 2009: 169 - 2007
- [c5]Sophie Cockroft, Raul Trejo:
The Role of Proximity in Willingness to Transact: The Effects of Trust and Culture. AMCIS 2007: 307 - 2002
- [j6]Raul Trejo, Vladik Kreinovich, I. R. Goodman, Jesus Martinez, Reginaldo Gonzalez:
A realistic (non-associative) logic and a possible explanations of 7 pm 2 law. Int. J. Approx. Reason. 29(3): 235-266 (2002) - [j5]Raul Trejo, Vladik Kreinovich:
Computing the shape of the image of a multi-linear mapping is possible but computationally intractable: Theorems. Int. J. Gen. Syst. 31(1): 17-27 (2002) - 2001
- [j4]Raul Trejo, Joel Galloway, Charanjiv Sachar, Vladik Kreinovich, Chitta Baral, Le-Chi Tuan:
From Planning to Searching for the Shortest Plan: An Optimal Transition. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 9(6): 827-837 (2001) - [c4]Chitta Baral, Vladik Kreinovich, Raul Trejo:
Computational Complexity of Planning with Temporal Goals. IJCAI 2001: 509-514 - 2000
- [j3]Chitta Baral, Vladik Kreinovich, Raul Trejo:
Computational complexity of planning and approximate planning in the presence of incompleteness. Artif. Intell. 122(1-2): 241-267 (2000) - [j2]Raul Trejo, Vladik Kreinovich, Luc Longpré:
Choosing a Physical Model: Why Symmetries? Bull. EATCS 70: 159-161 (2000) - [c3]Raul Trejo, Vladik Kreinovich, Chitta Baral:
Towards Feasible Approach to Plan Checking under Probabilistic Uncertainty: Interval Methods. AAAI/IAAI 2000: 545-550 - [c2]Chitta Baral, Le-Chi Tuan, Raul Trejo, Vladik Kreinovich:
Computational Complexity of Planning Based on Partial Information about the System's Present and Past States. Computational Logic 2000: 882-896
1990 – 1999
- 1999
- [c1]Chitta Baral, Vladik Kreinovich, Raul Trejo:
Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness. IJCAI 1999: 948-955 - 1996
- [j1]Robert N. Lea, Vladik Kreinovich, Raul Trejo:
Optimal interval enclosures for fractionally-linear functions, and their application to intelligent control. Reliab. Comput. 2(3): 265-285 (1996)
Coauthor Index
![](https://dblp.dagstuhl.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.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint