Results 11 to 20 of about 5,144,087 (289)
Enumerating Answers to First-Order Queries over Databases of Low Degree [PDF]
Logical Methods in Computer Science, 2022 A class of relational databases has low degree if for all $\delta>0$, all but finitely many databases in the class have degree at most $n^{\delta}$, where $n$ is the size of the database.
Arnaud Durand +2 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
When Can We Answer Queries Using Result-Bounded Data Interfaces? [PDF]
Logical Methods in Computer Science, 2022 We consider answering queries on data available through access methods, that provide lookup access to the tuples matching a given binding. Such interfaces are common on the Web; further, they often have bounds on how many results they can return, e.g ...
Antoine Amarilli, Michael Benedikt
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
Parity and Streett Games with Costs [PDF]
Logical Methods in Computer Science, 2014 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.
Nathanaël Fijalkow, Martin Zimmermann
doaj +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
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
Opportunities and challenges in using AI Chatbots in Higher Education [PDF]
, 2019 Artificial intelligence (AI) conversational chatbots have gained popularity over time, and have been widely used in the fields of e-commerce, online banking, and digital healthcare and well-being, among others. The technology has the potential to provide
Evans, Chris +1 more
core +1 more source
Relative Entailment Among Probabilistic Implications [PDF]
Logical Methods in Computer Science, 2019 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 ...
Albert Atserias +2 more
doaj +1 more source
, 2018 Every new technology brings new opportunity for crime, and information and communication technology (ICT) is no exception. This short article offers students of crime insights in the two main connections between ICT and criminology. On the one hand we show how ICT can be used as a tool, target, or location of crime.
Hartel, P.H. (author) +1 more
openaire +6 more sources