Results 11 to 20 of about 917,927 (214)
On Local Testability in the Non-Signaling Setting [PDF]
, 2020 Non-signaling strategies are a generalization of quantum strategies that have been studied in physics for decades, and have recently found applications in theoretical computer science.
Chiesa, Alessandro +2 more
core +1 more source
A Sound and Complete Axiomatization of Majority-n Logic [PDF]
, 2015 Manipulating logic functions via majority operators recently drew the attention of researchers in computer science. For example, circuit optimization based on majority operators enables superior results as compared to traditional logic systems. Also, the
Amaru, Luca +3 more
core +2 more sources
Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic [PDF]
, 2000 Takeuti and Titani have introduced and investigated a logic they called intuitionistic fuzzy logic. This logic is characterized as the first-order Goedel logic based on the truth value set [0,1].
Baaz, Matthias, Zach, Richard
core +4 more sources
On properties of $B$-terms [PDF]
, 2020 $B$-terms are built from the $B$ combinator alone defined by $B\equiv\lambda fgx. f(g~x)$, which is well known as a function composition operator.
Ikebuchi, Mirai, Nakano, Keisuke
core +2 more sources
A Call to Arms: Revisiting Database Design [PDF]
, 2011 Good database design is crucial to obtain a sound, consistent database, and - in turn - good database design methodologies are the best way to achieve the right design.
Antonio Badia +8 more
core +3 more sources
, 2016 During 2013-14, our group developed the algorithm for a computational framework for interpreting sound in poetry, which allows us to detect sonic patterns and relationships in poetry.
Katharine Coles +3 more
core +1 more source
inPractice: a practical nursing package for clinical decisions [PDF]
, 2005 This paper examines the recent development of a computer-assisted learning program-in Practice-at the School of Health Science, in the University of Wales Swansea. The project, which began in 2001, was developed in close collaboration with The Meningitis
Cavanna, Annlouise +2 more
core +2 more sources
Faithful (meta-)encodings of programmable strategies into term rewriting systems [PDF]
, 2017 Rewriting is a formalism widely used in computer science and mathematical logic. When using rewriting as a programming or modeling paradigm, the rewrite rules describe the transformations one wants to operate and rewriting strategies are used to con ...
Cirstea, Horatiu +2 more
core +4 more sources
Canonized Rewriting and Ground AC Completion Modulo Shostak Theories : Design and Implementation [PDF]
, 2011 AC-completion efficiently handles equality modulo associative and commutative function symbols. When the input is ground, the procedure terminates and provides a decision algorithm for the word problem.
Evelyne Contejean +3 more
core +6 more sources
Re-verification of a Lip Synchronization Protocol using Robust Reachability [PDF]
, 2010 The timed automata formalism is an important model for specifying and analysing real-time systems. Robustness is the correctness of the model in the presence of small drifts on clocks or imprecision in testing guards.
Bujorianu, L.M. +4 more
core +5 more sources