设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Elsevier电子期刊(52)
在“
Elsevier电子期刊
”中,
命中:
52
条,耗时:小于0.01 秒
在所有数据库中总计命中:
52
条
1.
Succinctness
and tractability of closure operator representations
作者:
Sebastian Rudolph
sebastian.rudolph@tu-dresden.de
关键词:
Closure operators
;
Formal contexts
;
Implications
;
Tractability
;
Succinctness
;
Computational properties
刊名:Theoretical Computer Science
出版年:2017
2.
Foundations of Boolean stream runtime verification
作者:
Laura Bozzelli
a
;
laura.bozzelli@fi.upm.es" class="auth_mail" title="E-mail the corresponding author
;
Cé
;
sar Sá
;
nchez
b
;
cesar.sanchez@imdea.org" class="auth_mail" title="E-mail the corresponding author
关键词:
Complexity and expressiveness
;
Succinctness
;
Efficiency in closure operations
;
Offline monitoring
刊名:Theoretical Computer Science
出版年:2016
3.
A note on the size of prenex normal forms
作者:
Frederik Harwath
harwath@cs.uni-frankfurt.de" class="auth_mail" title="E-mail the corresponding author
关键词:
Algorithms
;
Formal methods
;
Logic in computer science
;
Formula size and
succinctness
刊名:Information Processing Letters
出版年:2016
4.
On the
succinctness
of some modal logics
作者:
Tim French
a
;
tim@csse.uwa.edu.au
;
Wiebe van der Hoek
b
;
wiebe@csc.liv.ac.uk
;
Petar Iliev
b
;
pvi@liverpool.ac.uk
;
Barteld Kooi
c
;
B.P.Kooi@rug.nl
关键词:
Knowledge representation
;
Modal logic
;
Succinctness
;
Epistemic logic
;
Finite model theory of modal logic
;
Description logics
;
Boolean modal logic
刊名:Artificial Intelligence
出版年:2013
5.
State
succinctness
of two-way finite automata with quantum and classical states
作者:
Shenggen Zheng
;
Daowen Qiu
;
Jozef Gruska
;
Lvzhou Li
;
Paulo Mateus
关键词:
Computing models
;
Quantum finite automata
;
State complexity
;
Succinctness
刊名:Theoretical Computer Science
出版年:2013
6.
The price of query rewriting in ontology-based data access
作者:
Georg Gottlob
a
;
georg.gottlob@cs.ox.ac.uk" class="auth_mail
;
Stanislav Kikot
b
;
staskikotx@gmail.com" class="auth_mail
;
Roman Kontchakov
b
;
roman@dcs.bbk.ac.uk" class="auth_mail
;
Vladimir Podolskii
c
;
podolskii@mi.ras.ru" class="auth_mail
;
Thomas Schwentick
d
;
thomas.schwentick@udo.edu" class="auth_mail
;
Michael Zakharyaschev
b
;
michael@dcs.bbk.ac.uk" class="auth_mail
关键词:
Ontology
;
Datalog
;
Conjunctive query
;
Query rewriting
;
Succinctness
;
Boolean circuit
;
Monotone complexity
刊名:Artificial Intelligence
出版年:August 2014
7.
Regular languages of partial words
作者:
Jü
;
rgen Dassow
a
;
dassow@iws.cs.uni-magdeburg.de" class="auth_mail
;
Florin Manea
b
;
c
;
flm@informatik.uni-kiel.de" class="auth_mail
;
Robert Merca艧
a
;
b
;
rgm@informatik.uni-kiel.de" class="auth_mail
关键词:
Automata theory
;
Partial word
;
Regular language
;
Finite automaton
;
Language of partial word
刊名:Information Sciences
出版年:1 June, 2014
8.
Complexity and
succinctness
issues for linear-time hybrid logics
作者:
Laura Bozzelli
;
Ruggero Lanotte
关键词:
Linear temporal logics + past
;
Hybrid logics
;
Complexity and
succinctness
issues
;
Alternating automata
刊名:Theoretical Computer Science
出版年:2010
9.
Succinctness
of regular expressions with interleaving, intersection and counting
作者:
Wouter Gelade
关键词:
Regular Expressions
;
Succinctness
刊名:Theoretical Computer Science
出版年:2010
10.
Equilibria problems on games: Complexity versus
succinctness
作者:
Carme À
;
lvarez
;
;
alvarez@lsi.upc.edu
;
Joaquim Gabarro
;
;
gabarro@lsi.upc.edu
;
Maria Serna
;
;
mjserna@lsi.upc.edu
关键词:
Extensive games
;
Strategic games
;
Nash equilibria
;
Complexity classes
;
Succinct representations
刊名:Journal of Computer and System Sciences
出版年:2011
1
2
3
4
5
6
按检索点细分(52)
题名(13)
关键词(15)
文摘(43)
按出版年细分(52)
2027年及以后(1)
2017年(1)
2016年(2)
2013年(6)
2012年(4)
2011年(8)
2010年(3)
2009年(1)
2008年(2)
2007年(3)
2006年(1)
2005年(4)
2004年(2)
2003年(1)
2001年(1)
2000年(2)
2000年及以前(10)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.