Search Results - Descriptive complexity and finite models

The Rabin index of parity games: Its complexity and approximation by Huth, Michael, Kuo, Jim Huan-Pu, Piterman, Nir

“…We study the descriptive complexity of parity games by taking into account the coloring of their game graphs whilst ignoring their ownership structure…”
Get full text

Descriptive complexity and revealed preference theory by Galambos, Adam

“… is closely connected with the computational tractability of testing that theory. The connection is made through results in descriptive complexity theory, a relatively new field in finite model theory…”
Get full text

On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry by Hill, Cameron Donnay

“… – an important current in Finite Model Theory and Descriptive Complexity Theory – has a second face in Geometric Model Theory…”
Get full text

Descriptive complexity of controllable graphs by Abiad, Aida, Dawar, Anuj, Zapata, Octavio

“…Let G be a graph on n vertices with adjacency matrix A, and let 1 be the all-ones vector. We call G controllable if the set of vectors 1, A1,..., An-11 spans…”
Get full text

Arboreal Categories: An Axiomatic Theory of Resources by Abramsky, Samson, Reggio, Luca

“…Game comonads provide a categorical syntax-free approach to finite model theory, and their Eilenberg-Moore coalgebras typically encode important combinatorial parameters of structures…”
Get full text

Group Order Logic by Dahan, Anatole

“…). As was the case for FP + rk, the model-checking of FP + ord formulae is polynomial-time computable…”
Get full text

Inductive Inference by Using Information Compression by Choi, Ben

“… This article proposes inductive inference techniques to address three inductive problems: (1) how to automatically construct a general description, a model, or a theory to describe a sequence of observations or experimental data…”
Get full text

Definable relations in finite-dimensional subspace lattices with involution by Herrmann, Christian, Ziegler, Martin

“…For a large class of finite dimensional inner product spaces V , over division ∗ -rings F , we consider definable relations on the subspace lattice L ( V…”
Get full text

HBIM LEVEL OF DETAIL-GEOMETRY-ACCURACY AND SURVEY ANALYSIS FOR ARCHITECTURAL PRESERVATION by Brumana, R., Banfi, F., Cantini, L., Previtali, M., Della Torre, S.

“… In the past centuries, the representation was centred on the theoretical roles of the descriptive geometry devoted to the representation of the architectural elements complexity in the space…”
Get full text

A Finite-Model-Theoretic View on Propositional Proof Complexity by Grädel, Erich, Grohe, Martin, Pago, Benedikt, Pakusa, Wied

“…We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory…”
Get full text

Querying the Guarded Fragment by Bárány, Vince, Gottlob, Georg, Otto, Martin

“…, and finite-model property of the guarded fragment do not obviously carry over to conjunctive query answering…”
Get full text

The Descriptive Complexity Approach to LOGCFL by Lautemann, Clemens, McKenzie, Pierre, Schwentick, Thomas, Vollmer, Heribert

“…Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we…”
Get full text

Querying the Guarded Fragment by Bárány, Vince, Gottlob, Georg, Otto, Martin

“…, and finite-model property of the guarded fragment do not obviously carry over to conjunctive query answering…”
Get full text

Characterising Choiceless Polynomial Time with First-Order Interpretations by Gradel, Erich, Pakusa, Wied, Schalthofer, Svenja, Kaiser, Lukasz

“… It is a strict extension of fixed-point logic with counting, but to date the question is open whether it expresses all polynomial-time properties of finite structures…”
Get full text

Quillen Model Categories-Based Notions of Locality of Logics over Finite Structures by Maia, Hendrick

“…Locality is a property of logics, whose origins lie in the works of Hanf and Gaifman, having their utility in the context of finite model theory…”
Get full text

The Quest for a Logic Capturing PTIME by Grohe, M.

“…The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory…”
Get full text

Complexity multiscale asynchrony measure and behavior for interacting financial dynamics by Yang, Ge, Wang, Jun, Niu, Hongli

“…A stochastic financial price process is proposed and investigated by the finite-range multitype contact dynamical system, in an attempt to study the nonlinear behaviors of real asset markets…”
Get full text

An Adaptive Sampling Algorithm for Simulation-Based Optimization With Descriptive Complexity Preference by Jia, Qing-Shan

“… (or solution candidates) with low descriptive complexity (called simple designs) are usually preferred over complex ones when their performances are close…”
Get full text

Choiceless polynomial time, counting and the Cai–Fürer–Immerman graphs by Dawar, Anuj, Richerby, David, Rossman, Benjamin

“… The program we present uses sets of unbounded finite rank: we demonstrate that this is necessary by showing that the query cannot be computed by any program that has a constant bound on the rank of sets used, even in C ̃ PT(Card…”
Get full text

A Second-Order Logic in Which Variables Range over Relations with Complete First-Order Types by Grosso, A L, Turull-Torres, José M

“…We introduce a restriction of second order logic, SO F , for finite structures. In this restriction the quantifiers range over relation closed by the equivalence relation Ξ FO…”
Get full text