A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
On the Treewidth of Dynamic Graphs
[article]

2012
*
arXiv
*
pre-print

*logic*and graphs of

*bounded*local treewidth. ... Courcelle's Theorem gives a general tractability result

*for*problems expressible in monadic second order

*logic*on graphs of

*bounded*treewidth, and Frick & Grohe demonstrate a similar result

*for*first order ... SCDC is fixed-parameter tractable

*for*

*dynamic*graphs of

*bounded*local treewidth. As first order

*logic*is a subset of monadic second order

*logic*we may also use Theorem 7. Corollary 11. ...

##
###
Circuits, Logic and Games (Dagstuhl Seminar 15401)

2016
*
Dagstuhl Reports
*

*complexity*and circuit lower

*bounds*inherently using methods from

*logic*and algebra Proof systems with low circuit

*complexity*

*Dynamic*

*complexity*: understanding the

*dynamic*expressive power of small depth ...

*for*circuits. ... These talks covered results in two-variable first-order

*logic*;

*dynamic*

*complexity*; graph colouring; database theory; circuit lower

*bounds*;

*logics*on words; and semigroup techniques. ...

##
###
On the Treewidth of Dynamic Graphs
[chapter]

2013
*
Lecture Notes in Computer Science
*

Courcelle's Theorem gives a general tractability result

doi:10.1007/978-3-642-38768-5_32
fatcat:miynieup6rfdrkc46vf4w3zp7i
*for*problems expressible in monadic second order*logic*on graphs of*bounded*treewidth, and Frick and Grohe demonstrate a similar result*for*first ... order*logic*and graphs of*bounded*local treewidth. ... We note that the third common definition*for*sparse*dynamic*graphs, using*some*measure of density of the graph, does not lead to*bounded*local treewidth. ...##
###
On the treewidth of dynamic graphs

2014
*
Theoretical Computer Science
*

Courcelle's Theorem gives a general tractability result

doi:10.1016/j.tcs.2013.12.024
fatcat:cbpjf6h62vdxxjdssqrw74h5vu
*for*problems expressible in monadic second order*logic*on graphs of*bounded*treewidth, and Frick and Grohe demonstrate a similar result*for*first ... order*logic*and graphs of*bounded*local treewidth. ... We note that the third common definition*for*sparse*dynamic*graphs, using*some*measure of density of the graph, does not lead to*bounded*local treewidth. ...##
###
Combining Equilibrium Logic and Dynamic Logic
[chapter]

2013
*
Lecture Notes in Computer Science
*

2013

doi:10.1007/978-3-642-40564-8_30
fatcat:e7hfirkthrbilpaujzp6p62y3y
*for*their helpful comments. ...*logic*to*dynamic**logic*of propositional assignments. ... This establishes an EXPTIME upper*bound**for*the*complexity*of the latter problem. We also show that the upper*bound*is tight. ...##
###
Descriptive Control Theory: A Proposal
[article]

2014
*
arXiv
*
pre-print

To change this situation, we need a

arXiv:1409.3560v2
fatcat:fwqonimsyfh6ffu7ni77m2wtey
*logical*and computational foundation*for*control theory. ... If the program is successfully carried out,*logical*approaches will significantly extend existing engineering methods towards a unified methodology*for*handling nonlinear and hybrid systems, and bring ...*some*choices of numerical error*bounds*δ 1 , δ 2 , δ 3 ∈ Q + . ...##
###
The dynamic complexity of formal languages

2012
*
ACM Transactions on Computational Logic
*

This enables lower

doi:10.1145/2287718.2287719
fatcat:amvn2uah6fb7latv5cw4ycos7q
*bounds**for*DynPROP and separates DynPROP from DynQF and DynFO. ... Furthermore, the*dynamic**complexity*of regular tree languages is investigated and*some*results concerning arbitrary structures are obtained: there exist first-order definable properties which are not maintainable ... As it is easy to show that every DynFO problem is in PTIME, a non-trivial lower*bound*result would have to show that the*dynamic**complexity*of*some*PTIME problem is not in DynFO. ...##
###
Page 4554 of Mathematical Reviews Vol. , Issue 91H
[page]

1991
*
Mathematical Reviews
*

*Some*approaches are,

*for*instance, based on the theory of probability, others on modal

*logic*. ... No

*dynamic*algorithms were known previously

*for*Problems | and 2.” ...

##
###
Page 6641 of Mathematical Reviews Vol. , Issue 2001I
[page]

2001
*
Mathematical Reviews
*

, Jerzy (PL-WASW; Warsaw) *

*Dynamic**logic*. ... The book consists of three parts: Fundamental concepts, Propositional*dynamic**logic*, and First-order*dynamic**logic*. ...##
###
Page 2429 of Mathematical Reviews Vol. , Issue 94d
[page]

1994
*
Mathematical Reviews
*

*Complex*Variables * 32038 Szekszard, 1991 Tables: Minimum-distance

*bounds*

*for*binary linear codes Primitive binary polynomials Theory of radicals Trieste, 1989 Trieste, 1990 Uxbridge, 1991 Varanasi, 1991 ... . *00022-* 00023 Shock induced transitions and phase structures in general

*Some*problems in the theory of nonlinear analysis, No. 2

*Some*problems on the theory of

*dynamical*systems in applied sciences ...

##
###
Finite and Algorithmic Model Theory (Dagstuhl Seminar 17361)

2018
*
Dagstuhl Reports
*

(Nothing better is known as an upper

doi:10.4230/dagrep.7.9.1
dblp:journals/dagstuhl-reports/DawarGKS17
fatcat:teyilwvdgrd6tch2gdb4d4dd5m
*bound*or lower*bound**for*PosSLP.)*Some*open problems Question: Can we obtain better*complexity**bounds**for*PosSLP? ... Thus, our dimension*bounds*also yield*bounds*on the*logical**complexity*of the graph classes. ... DynFO, as defined by Patnaik and Immerman, is the class of queries that can be*dynamically*maintained using first-order*logic*to update the query result and possibly further auxiliary relations, whenever ...##
###
Forthcoming Papers

2002
*
Artificial Intelligence
*

The intention is to help the reader to develop a 'feel'

doi:10.1016/s0004-3702(02)00216-3
fatcat:iqng4adjcbanxh46bjczyyedaa
*for*the field's history and*some*of its recent developments. The discussion is mainly limited to*logic*programs under the answer set semantics. ...*For*understanding of approaches to*logic*programming build on well-founded semantics, general theories of argumentation, abductive reasoning, etc., the reader is referred to other publications. 2002 ... Ben-Eliyahu-Zohary, Yet*some*more*complexity*results*for*default*logic*Y. Lebbah and O. Lhomme, Accelerating filtering techniques*for*numeric CSPs C. Dixon, M. Fisher and A. ...##
###
Page 3355 of Mathematical Reviews Vol. , Issue 91F
[page]

1991
*
Mathematical Reviews
*

The lower

*bound*Q(n/,/p + log(n))*for*the time*complexity*of the oblivious routing of n packets with distinct destinations on a constant degree network with p processors is established. ... In this book*some*new features*for**logic*program- ming are introduced which make possible efficient execution of constraint satisfaction programs, e.g., those involving branch and ...##
###
Page 3943 of Mathematical Reviews Vol. , Issue 92g
[page]

1992
*
Mathematical Reviews
*

Kiehn, Observing localities (extended abstract) (pp. 93-102); Gerardo Costa and Gianna Reggio, Abstract

*dynamic*data types: a temporal*logic*approach (pp. 103-112). ... It is shown that Q(nlogn) lower*bounds*can be derived*for*the expected message*complexity**for*computing AND on an input 1”, OR on an input 0” or XOR over all inputs, even when processors have unique iden ...##
###
Page 7008 of Mathematical Reviews Vol. , Issue 89M
[page]

1989
*
Mathematical Reviews
*

Results on lower

*bounds**for**some*of these problems are also presented. ... The second part of the chapter considers*dynamic*struc- tures with*bounded*resources, and presents an approach to the semantics of the PASCAL language based on*dynamic*structures. ...
« Previous

*Showing results 1 — 15 out of 319,013 results*