Results 31 to 40 of about 114,330 (265)
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
Executing Higher Order Logic [PDF]
, 2002 We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are compiled into a functional program. Functions and inductively defined relations can be mixed.
Stefan Berghofer, Tobias Nipkow
openaire +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
Extensional Higher-Order Logic Programming [PDF]
ACM Transactions on Computational Logic, 2010 We propose a purely extensional semantics for higher-order logic programming. In this semantics program predicates denote sets of ordered tuples, and two predicates are equal iff they are equal as sets. Moreover, every program has a unique minimum Herbrand model which is the greatest lower bound of all Herbrand models of the program and the least fixed-
Angelos Charalambidis +3 more
openaire +5 more sources
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