output
20032026
most citedTo Trust or to Think: Cognitive Forcing Functions Can Reduce Overreliance on AI in AI-assisted Decision-making

887 citations

Showing 2014Show all

11 papers · 1 filter

cs.FL2014

Complexity of Road Coloring with Prescribed Reset Words

Vojtěch Vorel, Adam Roman

By the Road Coloring Theorem (Trahtman, 2008), the edges of any aperiodic directed multigraph with a constant out-degree can be colored such that the resulting automaton admits a r…

cs.LO2014★ 15 cited

Correctness and completeness of logic programs

Włodzimierz Drabent

We discuss proving correctness and completeness of definite clause logic programs. We propose a method for proving completeness, while for proving correctness we employ a method wh…

cs.AI2014★ 2 cited

Neighborhood Selection and Rules Identification for Cellular Automata: A Rough Sets Approach

Bartlomiej Placzek

In this paper a method is proposed which uses data mining techniques based on rough sets theory to select neighborhood and determine update rule for cellular automata (CA). Accordi…

cs.NI2014★ 4 cited

Communication-aware algorithms for target tracking in wireless sensor networks

Bartlomiej Placzek

This paper introduces algorithms for target tracking in wireless sensor networks (WSNs) that enable reduction of data communication cost. The objective of the considered problem is…

cs.DC2014★ 2 cited

Infinite Networks, Halting and Local Algorithms

Antti Kuusisto

The immediate past has witnessed an increased amount of interest in local algorithms, i.e., constant time distributed algorithms. In a recent survey of the topic (Suomela, ACM Comp…

cs.PL2014★ 6 cited

Distributive Laws and Decidable Properties of SOS Specifications

Bartek Klin, Beata Nachyła

Some formats of well-behaved operational specifications, correspond to natural transformations of certain types (for example, GSOS and coGSOS laws). These transformations have a co…