Results 31 to 40 of about 1,309,863 (280)
Log-Linear-Based Logic Mining with Multi-Discrete Hopfield Neural Network
Mathematics, 2023 Choosing the best attribute from a dataset is a crucial step in effective logic mining since it has the greatest impact on improving the performance of the induced logic.
Gaeithry Manoharam +6 more
doaj +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
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-
Charalambidis, A. +3 more
openaire +5 more sources
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
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
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
, 2017 In this paper the logic of broad necessity is explored. Definitions of what it means for one modality to be broader than another are formulated, and it is proven, in the context of higher-order logic, that there is a broadest necessity, settling one of ...
Bacon, Andrew
core +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
Refinement of higher-order logic programs [PDF]
, 2003 A refinement calculus provides a method for transforming specifications to executable code, maintaining the correctness of the code with respect to its specification.
Colvin, Robert +3 more
core +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