Results 11 to 20 of about 10,600,895 (351)
One-Clock Priced Timed Games with Negative Weights [PDF]
Logical Methods in Computer Science, 2022 Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modelling the cost of spending time in a state and executing an action, respectively).
Thomas Brihaye +4 more
doaj +1 more source
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games [PDF]
Logical Methods in Computer Science, 2020 We study multiplayer quantitative reachability games played on a finite directed graph, where the objective of each player is to reach his target set of vertices as quickly as possible.
Thomas Brihaye +4 more
doaj +1 more source
Modular Path Queries with Arithmetic [PDF]
Logical Methods in Computer Science, 2021 We propose a new approach to querying graph databases. Our approach balances competing goals of expressive power, language clarity and computational complexity.
Jakub Michaliszyn +2 more
doaj +1 more source
Rewriting with Acyclic Queries: Mind Your Head [PDF]
Logical Methods in Computer Science, 2023 The paper studies the rewriting problem, that is, the decision problem whether, for a given conjunctive query $Q$ and a set $\mathcal{V}$ of views, there is a conjunctive query $Q'$ over $\mathcal{V}$ that is equivalent to $Q$, for cases where the query,
Gaetano Geck +3 more
doaj +1 more source
Constantin Gaindric -- 80th anniversary [PDF]
Computer Science Journal of Moldova, 2021 On September 11, 2021 Prof. Constantin Gaindric turns 80! This age does not track in any way with this person when you look at him.
The Editorial Board of Computer Science Journal of Moldova
doaj
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries [PDF]
Logical Methods in Computer Science, 2023 We investigate trade-offs in static and dynamic evaluation of hierarchical queries with arbitrary free variables. In the static setting, the trade-off is between the time to partially compute the query result and the delay needed to enumerate its tuples.
Ahmet Kara +3 more
doaj +1 more source
Engaging Equity Pedagogies in Computer Science Learning Environments
Journal of Computer Science Integration, 2020 In this position paper, we advocate for the use of equity-focused teaching and learning as an essential practice within computer science classrooms. We provide an overview of the theoretical underpinnings of various equity pedagogies (Banks & Banks, 1995)
Tia c. Madkins +2 more
semanticscholar +1 more source
Efficient Evaluation of Arbitrary Relational Calculus Queries [PDF]
Logical Methods in Computer Science, 2023 The relational calculus (RC) is a concise, declarative query language. However, existing RC query evaluation approaches are inefficient and often deviate from established algorithms based on finite tables used in database management systems.
Martin Raszyk +3 more
doaj +1 more source
Parity Games with Weights [PDF]
Logical Methods in Computer Science, 2019 Quantitative extensions of parity games have recently attracted significant interest. These extensions include parity games with energy and payoff conditions as well as finitary parity games and their generalization to parity games with costs.
Sven Schewe +2 more
doaj +1 more source
Robustness against Read Committed for Transaction Templates with Functional Constraints [PDF]
Logical Methods in Computer Science, 2023 The popular isolation level Multiversion Read Committed (RC) trades some of the strong guarantees of serializability for increased transaction throughput.
Brecht Vandevoort +3 more
doaj +1 more source