Results 1 to 10 of about 1,475 (68)
Induced betweenness in order-theoretic trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 The ternary relation B(x,y,z) of betweenness states that an element y is between the elements x and z, in some sense depending on the considered structure.
Bruno Courcelle
doaj +1 more source
Quantifying Shannon's Work Function for Cryptanalytic Attacks [PDF]
, 2010 Attacks on cryptographic systems are limited by the available computational resources. A theoretical understanding of these resource limitations is needed to evaluate the security of cryptographic primitives and procedures.
van Son, R. J. J. H.
core +16 more sources
Towards a Proof Theory of G\"odel Modal Logics [PDF]
Logical Methods in Computer Science, 2011 Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of G\"odel logic.
George Metcalfe, Nicola Olivetti
doaj +1 more source
Bounded Arithmetic in Free Logic [PDF]
Logical Methods in Computer Science, 2012 One of the central open questions in bounded arithmetic is whether Buss' hierarchy of theories of bounded arithmetic collapses or not. In this paper, we reformulate Buss' theories using free logic and conjecture that such theories are easier to handle ...
Yoriyuki Yamagata
doaj +1 more source
Specifying and Executing Optimizations for Parallel Programs
, 2014 Compiler optimizations, usually expressed as rewrites on program graphs, are a core part of all modern compilers. However, even production compilers have bugs, and these bugs are difficult to detect and resolve. The problem only becomes more complex when
Griffith, Dennis +2 more
core +8 more sources
Answering Non-Monotonic Queries in Relational Data Exchange [PDF]
Logical Methods in Computer Science, 2011 Relational data exchange is the problem of translating relational data from a source schema into a target schema, according to a specification of the relationship between the source data and the target data.
Andre Hernich
doaj +1 more source
Unification in the Description Logic EL [PDF]
Logical Methods in Computer Science, 2010 The Description Logic EL has recently drawn considerable attention since, on the one hand, important inference problems such as the subsumption problem are polynomial. On the other hand, EL is used to define large biomedical ontologies.
Franz Baader, Barbara Morawska
doaj +1 more source
Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance [PDF]
Logical Methods in Computer Science, 2010 Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for LF in the style of recent formulations where only canonical forms are ...
William Lovas, Frank Pfenning
doaj +1 more source
Modeling Adversaries in a Logic for Security Protocol Analysis [PDF]
Logical Methods in Computer Science, 2012 Logics for security protocol analysis require the formalization of an adversary model that specifies the capabilities of adversaries. A common model is the Dolev-Yao model, which considers only adversaries that can compose and replay messages, and ...
Joseph Y. Halpern, Riccardo Pucella
doaj +1 more source
Tree Languages Defined in First-Order Logic with One Quantifier Alternation [PDF]
Logical Methods in Computer Science, 2010 We study tree languages that can be defined in \Delta_2 . These are tree languages definable by a first-order formula whose quantifier prefix is forall exists, and simultaneously by a first-order formula whose quantifier prefix is .
Mikolaj Bojanczyk, Luc Segoufin
doaj +1 more source