Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Complexity hierarchies beyond elementary
S Schmitz - ACM Transactions on Computation Theory (TOCT), 2016 - dl.acm.org
We introduce a hierarchy of fast-growing complexity classes and show its suitability for
completeness statements of many nonelementary problems. This hierarchy allows the …
completeness statements of many nonelementary problems. This hierarchy allows the …
The era of big spatial data
The recent explosion in the amount of spatial data calls for specialized systems to handle
big spatial data. In this paper, we discuss the main features and components that needs to …
big spatial data. In this paper, we discuss the main features and components that needs to …
Color constancy and non-uniform illumination: Can existing algorithms work?
The color and distribution of illuminants can significantly alter the appearance of a scene.
The goal of color constancy (CC) is to remove the color bias introduced by the illuminants …
The goal of color constancy (CC) is to remove the color bias introduced by the illuminants …
[PDF][PDF] Interval temporal logics: a journey
We discuss a family of modal logics for reasoning about relational structures of intervals over
(usually) linear orders, with modal operators associated with the various binary relations …
(usually) linear orders, with modal operators associated with the various binary relations …
Checking interval properties of computations
Abstract Model checking is a powerful method widely explored in formal verification. Given a
model of a system, eg, a Kripke structure, and a formula specifying its expected behaviour …
model of a system, eg, a Kripke structure, and a formula specifying its expected behaviour …
The undecidability of the logic of subintervals
Abstract The Halpern–Shoham logic is a modal logic of time intervals. Some effort has been
put in last ten years to classify fragments of this beautiful logic with respect to decidability of …
put in last ten years to classify fragments of this beautiful logic with respect to decidability of …
[HTML][HTML] Interval temporal logics over strongly discrete linear orders: Expressiveness and complexity
Interval temporal logics provide a natural framework for temporal reasoning about interval
structures over linearly ordered domains, where intervals are taken as the primitive …
structures over linearly ordered domains, where intervals are taken as the primitive …
Horn fragments of the Halpern-Shoham interval temporal logic
We investigate the satisfiability problem for Horn fragments of the Halpern-Shoham interval
temporal logic depending on the type (box or diamond) of the interval modal operators, the …
temporal logic depending on the type (box or diamond) of the interval modal operators, the …
Decidability of model checking multi-agent systems against a class of EHS specifications
We define and illustrate the expressiveness of the fragment of the Epistemic Halpern–
Shoham Logic as a specification language for multi-agent systems. We consider the model …
Shoham Logic as a specification language for multi-agent systems. We consider the model …
The dark side of interval temporal logic: marking the undecidability border
Unlike the Moon, the dark side of interval temporal logics is the one we usually see: their
ubiquitous undecidability. Identifying minimal undecidable interval logics is thus a natural …
ubiquitous undecidability. Identifying minimal undecidable interval logics is thus a natural …