Results 41 to 50 of about 236,217 (313)
Proof Complexity of Non-classical Logics [PDF]
, 2012 Proof complexity is an interdisciplinary area of research utilising techniques from logic, complexity, and combinatorics towards the main aim of understanding the complexity of theorem proving procedures. Traditionally, propositional proofs have been the main object of investigation in proof complexity.
Beyersdorff, O, Kutz, O
openaire +4 more sources
Finding Good Proofs for Description Logic Entailments Using Recursive Quality Measures (Extended Technical Report) [PDF]
CADE, 2021 Logic-based approaches to AI have the advantage that their behavior can in principle be explained to a user. If, for instance, a Description Logic reasoner derives a consequence that triggers some action of the overall system, then one can explain such ...
Christian Alrabbaa +4 more
semanticscholar +1 more source
, 2016 Quantum information and computation provide a fascinating twist on the notion of proofs in computational complexity theory. For instance, one may consider a quantum computational analogue of the complexity class \class{NP}, known as QMA, in which a ...
Vidick, Thomas, Watrous, John
core +2 more sources
𝑘-error linear complexity over 𝔽p of subsequences of Sidelnikov sequences of period (pr – 1)/3
Journal of Mathematical Cryptology, 2009 Subsequences of Sidelnikov sequences have several desirable cryptographic features such as high linear complexity over 𝔽2 and small aperiodic autocorrelation.
Brandstätter Nina, Winterhof Arne
doaj +1 more source
Resolution over Linear Equations and Multilinear Proofs [PDF]
, 2007 We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead of clauses.
Alekhnovich +26 more
core +4 more sources
Validating Back-links of FOLID Cyclic Pre-proofs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 Cyclic pre-proofs can be represented as sets of finite tree derivations with back-links. In the frame of the first-order logic with inductive definitions, the nodes of the tree derivations are labelled by sequents and the back-links connect particular ...
Sorin Stratulat
doaj +1 more source
Double-Blind Proof of Existence for Decentralized Identities
IEEE Access, 2023 Decentralized identities return control of identities to the identity owners. Although current work enhances the privacy of these publicly stored identities using encryption and zero-knowledge proofs, decentralized identities can still be abused due to ...
Jayamine Alupotha
doaj +1 more source
Model-Checking Problems as a Basis for Parameterized Intractability [PDF]
Logical Methods in Computer Science, 2005 Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form.
Joerg Flum, Martin Grohe
doaj +1 more source
Fast and compact self-stabilizing verification, computation, and fault detection of an MST [PDF]
, 2015 This paper demonstrates the usefulness of distributed local verification of proofs, as a tool for the design of self-stabilizing algorithms.In particular, it introduces a somewhat generalized notion of distributed local proofs, and utilizes it for ...
Korman, Amos +2 more
core +6 more sources
, 2022 The CSP (constraint satisfaction problems) is a class of problems deciding whether there exists a homomorphism from an instance relational structure to a target one. The CSP dichotomy is a profound result recently proved by Zhuk (2020, J. ACM, 67) and Bulatov (2017, FOCS, 58).
openaire +2 more sources