Biblio Discovery — Demo Discovery Service

143.606 hasil untuk "Computer science"

Menampilkan 1–20 · 0,48 detik · RSS

  1. Artikel Jurnal

    COMPUTER SCIENCE IN THE EDUCATION OF UKRAINE: FORMATION PROSPECTS

    Viktor Shakotko

    Ìнформаційні технології в освіті, Iss 29, Pp 116-130 (2016) · 2016 · Ukraina · DOAJ

    The article deals with the formation of computer science as science and school subject as well in the system of education in Ukraine taking into consideration the development tendencies of this science in the world. The introduction of the notion« information technology», «computer science» and…

  2. Artikel Jurnal

    Characterizing Positionality in Games of Infinite Duration over Infinite Graphs

    Pierre Ohlmann

    TheoretiCS, Vol. Volume 2 · 2023 · Inggris · DOAJ Scopus

    We study turn-based quantitative games of infinite duration opposing two antagonistic players and played over graphs. This model is widely accepted as providing the adequate framework for formalizing the synthesis question for reactive systems. This important application motivates the question of…

  3. Artikel Jurnal

    The Descriptive Complexity of Graph Neural Networks

    Martin Grohe

    TheoretiCS, Vol. Volume 3 · 2024 · Inggris · DOAJ Scopus

    We analyse the power of graph neural networks (GNNs) in terms of Boolean circuit complexity and descriptive complexity. We prove that the graph queries that can be computed by a polynomial-size bounded-depth family of GNNs are exactly those definable in the guarded fragment GFO+C of first-order…

Dari koleksi institusi

Perpustakaan Kampus · 3 judul cetakLihat semua
  1. Artikel Jurnal

    Designing Equilibria in Concurrent Games with Social Welfare and Temporal Logic Constraints

    Julian Gutierrez; Muhammad Najib; Giuseppe Perelli dkk.

    Logical Methods in Computer Science, Vol. Volume 20 No. ue 4 · 2024 · Inggris · DOAJ Scopus

    In game theory, mechanism design is concerned with the design of incentives so that a desired outcome of the game can be achieved. In this paper, we explore the concept of equilibrium design, where incentives are designed to obtain a desirable equilibrium that satisfies a specific temporal logic…

  2. Artikel Jurnal

    Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs

    Patricia Bouyer; Mickael Randour; Pierre Vandenhove

    TheoretiCS, Vol. Volume 2 · 2023 · Inggris · DOAJ Scopus

    …objectives, due to its relation to many natural problems in theoretical computer science. We focus on the strategy complexity question: given an objective, how much memory does each player require to play as well as possible? A classical result is that finite-memory strategies suffice for both…

  3. Artikel Jurnal

    Parity and Streett Games with Costs

    Nathanaël Fijalkow; Martin Zimmermann

    Logical Methods in Computer Science, Vol. Volume 10 No. ue 2 · 2014 · Inggris · DOAJ Scopus

    We consider two-player games played on finite graphs equipped with costs on edges and introduce two winning conditions, cost-parity and cost-Streett, which require bounds on the cost between requests and their responses. Both conditions generalize the corresponding classical omega-regular…

  4. Artikel Jurnal

    Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras

    Libor Barto; Zarathustra Brady; Andrei Bulatov dkk.

    TheoretiCS, Vol. Volume 3 · 2024 · Inggris · DOAJ Scopus

    This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP). We unify, simplify, and extend parts of the three approaches that have been developed to study the CSP over finite templates -- absorption theory that…

  5. Artikel Jurnal

    Conditional Dichotomy of Boolean Ordered Promise CSPs

    Joshua Brakensiek; Venkatesan Guruswami; Sai Sandeep

    TheoretiCS, Vol. Volume 2 · 2023 · Inggris · DOAJ Scopus

    Promise Constraint Satisfaction Problems (PCSPs) are a generalization of Constraint Satisfaction Problems (CSPs) where each predicate has a strong and a weak form and given a CSP instance, the objective is to distinguish if the strong form can be satisfied vs. even the weak form cannot be…

  6. Artikel Jurnal

    The Complexity of All-switches Strategy Improvement

    John Fearnley; Rahul Savani

    Logical Methods in Computer Science, Vol. Volume 14 No. ue 4 · 2018 · Inggris · DOAJ Scopus

    Strategy improvement is a widely-used and well-studied class of algorithms for solving graph-based infinite games. These algorithms are parameterized by a switching rule, and one of the most natural rules is "all switches" which switches as many edges as possible in each iteration. Continuing a…

  7. Artikel Jurnal

    The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games

    Thomas Brihaye; Véronique Bruyère; Aline Goeminne dkk.

    Logical Methods in Computer Science, Vol. Volume 16 No. ue 4 · 2020 · Inggris · DOAJ Scopus

    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. Instead of the well-known notion of Nash equilibrium (NE), we focus on the notion of subgame perfect equilibrium…

  8. Artikel Jurnal

    Parity Games with Weights

    Sven Schewe; Alexander Weinert; Martin Zimmermann

    Logical Methods in Computer Science, Vol. Volume 15 No. ue 3 · 2019 · Inggris · DOAJ Scopus

    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. Finitary parity games enjoy a special status among…

  9. Artikel Jurnal

    Determinacy in Discrete-Bidding Infinite-Duration Games

    Milad Aghajohari; Guy Avni; Thomas A. Henzinger

    Logical Methods in Computer Science, Vol. Volume 17 No. ue 1 · 2021 · Inggris · DOAJ Scopus

    In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players…

  10. Artikel Jurnal

    Interface Modeling for Quality and Resource Management

    Martijn Hendriks; Marc Geilen; Kees Goossens dkk.

    Logical Methods in Computer Science, Vol. Volume 17 No. ue 2 · 2021 · Inggris · DOAJ Scopus

    We develop an interface-modeling framework for quality and resource management that captures configurable working points of hardware and software components in terms of functionality, resource usage and provision, and quality indicators such as performance and energy consumption. We base these…

  11. Artikel Jurnal

    Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics

    Cristina Feier; Antti Kuusisto; Carsten Lutz

    Logical Methods in Computer Science, Vol. Volume 15 No. ue 2 · 2019 · Inggris · DOAJ Scopus

    We study rewritability of monadic disjunctive Datalog programs, (the complements of) MMSNP sentences, and ontology-mediated queries (OMQs) based on expressive description logics of the ALC family and on conjunctive queries. We show that rewritability into FO and into monadic Datalog (MDLog) are…

  12. Artikel Jurnal

    Pure Nash Equilibria in Concurrent Deterministic Games

    Patricia Bouyer; Romain Brenguier; Nicolas Markey dkk.

    Logical Methods in Computer Science, Vol. Volume 11 No. ue 2 · 2015 · Inggris · DOAJ Scopus

    We study pure-strategy Nash equilibria in multi-player concurrent deterministic games, for a variety of preference relations. We provide a novel construction, called the suspect game, which transforms a multi-player concurrent game into a two-player turn-based game which turns Nash equilibria into…

  13. Artikel Jurnal

    One-Clock Priced Timed Games with Negative Weights

    Thomas Brihaye; Gilles Geeraerts; Axel Haddad dkk.

    Logical Methods in Computer Science, Vol. Volume 18 No. ue 3 · 2022 · Inggris · DOAJ Scopus

    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). The goals of the players are to minimise and maximise the cost to reach a…

  14. Artikel Jurnal

    Relative Entailment Among Probabilistic Implications

    Albert Atserias; José L. Balcázar; Marie Ely Piceno

    Logical Methods in Computer Science, Vol. Volume 15 No. ue 1 · 2019 · Inggris · DOAJ Scopus

    We study a natural variant of the implicational fragment of propositional logic. Its formulas are pairs of conjunctions of positive literals, related together by an implicational-like connective; the semantics of this sort of implication is defined in terms of a threshold on a conditional…

  15. Artikel Jurnal

    Decidability of Querying First-Order Theories via Countermodels of Finite Width

    Thomas Feller; Tim S. Lyon; Piotr Ostropolski-Nalewaja dkk.

    Logical Methods in Computer Science, Vol. Volume 21 No. ue 2 · 2025 · Inggris · DOAJ Scopus

    We propose a generic framework for establishing the decidability of a wide range of logical entailment problems (briefly called querying), based on the existence of countermodels that are structurally simple, gauged by certain types of width measures (with treewidth and cliquewidth as popular…

  16. Artikel Jurnal

    On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction

    Barnaby Martin; Manuel Bodirsky; Martin Hils

    Logical Methods in Computer Science, Vol. Volume 8 No. ue 3 · 2012 · Inggris · DOAJ Scopus

    The universal-algebraic approach has proved a powerful tool in the study of the complexity of CSPs. This approach has previously been applied to the study of CSPs with finite or (infinite) omega-categorical templates, and relies on two facts. The first is that in finite or omega-categorical…

  17. Artikel Jurnal

    Reasonable Space for the ${\lambda}$-Calculus, Logarithmically

    Beniamino Accattoli; Ugo Dal Lago; Gabriele Vanoni

    Logical Methods in Computer Science, Vol. Volume 20 No. ue 4 · 2024 · Inggris · DOAJ Scopus

    Can the $\lambda$-calculus be considered a reasonable computational model? Can we use it for measuring the time $\textit{and}$ space consumption of algorithms? While the literature contains positive answers about time, much less is known about space. This paper presents a new reasonable space cost…

Menampilkan maksimal 50 halaman. Persempit pencarian dengan filter untuk hasil yang lebih spesifik.