Results 41 to 50 of about 16,571,812 (297)
The succinctness of first-order logic on linear orders [PDF]
, 2011 Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of (approximately) the ...
Schweikardt, Nicole, Grohe, Martin
core +1 more source
A Functional (Monadic) Second-Order Theory of Infinite Trees [PDF]
Logical Methods in Computer Science, 2020 This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite trees. MSO on infinite trees is a rich system, and its decidability ("Rabin's Tree Theorem") is one of the most powerful known results concerning the ...
Anupam Das, Colin Riba
doaj +1 more source
Language and Proofs for Higher-Order SMT (Work in Progress) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Satisfiability modulo theories (SMT) solvers have throughout the years been able to cope with increasingly expressive formulas, from ground logics to full first-order logic modulo theories.
Haniel Barbosa +4 more
doaj +1 more source
A Methodology for the Formal Verification of Dynamic Fault Trees Using HOL Theorem Proving
IEEE Access, 2019 Dynamic Fault Trees (DFTs) are increasingly being used for modeling the failure behaviors of systems, particularly dynamic behaviors that cannot be captured using conventional combinatorial models.
Yassmeen Elderhalli +2 more
doaj +1 more source
European Journal of Tourism Research, 2023 Service-dominant logic (SDL) and the concept of customer value (CCV) are both phenomenological approaches to value creation, deeply applied to tourism services.
Martina Gallarza +2 more
doaj +1 more source
IEEE Access, 2020 Next-generation transportation will be integrated, interconnected and highly autonomous. One key challenge in traffic management is ensuring safety while maintaining the required level of service quality.
Adnan Rashid +3 more
doaj +1 more source
Systematic Verification of the Modal Logic Cube in Isabelle/HOL [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We present an automated verification of the well-known modal logic cube in Isabelle/HOL, in which we prove the inclusion relations between the cube's logics using automated reasoning tools. Prior work addresses this problem but without restriction to the
Christoph Benzmüller +2 more
doaj +1 more source
Extending Nunchaku to Dependent Type Theory [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Nunchaku is a new higher-order counterexample generator based on a sequence of transformations from polymorphic higher-order logic to first-order logic. Unlike its predecessor Nitpick for Isabelle, it is designed as a stand-alone tool, with frontends for
Simon Cruanes +1 more
doaj +1 more source
Duality Theory and Categorical Universal Logic: With Emphasis on Quantum Structures [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Categorical Universal Logic is a theory of monad-relativised hyperdoctrines (or fibred universal algebras), which in particular encompasses categorical forms of both first-order and higher-order quantum logics as well as classical, intuitionistic, and ...
Yoshihiro Maruyama
doaj +1 more source
Nested Hoare Triples and Frame Rules for Higher-order Store [PDF]
Logical Methods in Computer Science, 2011 Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level languages with ML-style general (higher-order) storage, we investigate the ...
Jan Schwinghammer +3 more
doaj +1 more source