Results 11 to 20 of about 970 (166)
Predicate Abstraction via Symbolic Decision Procedures [PDF]
Logical Methods in Computer Science, 2007 We present a new approach for performing predicate abstraction based on symbolic decision procedures. Intuitively, a symbolic decision procedure for a theory takes a set of predicates in the theory and symbolically executes a decision procedure on all ...
Shuvendu K. Lahiri +2 more
doaj +3 more sources
First-order composition-nominative logics with predicates of weak equality and of strong equality [PDF]
PROBLEMS IN PROGRAMMING, 2019 Development of the new software-oriented logical formalisms is a topical problem. The paper introduces logics of partial predicates with predicate complement and equality predicates, we denote them LCE. They extend logics of quasiary predicates with equality and logics with predicate complement.
Shkilniak, S.S.
core +8 more sources
Deciding set-theoretic formulae with the predicate 'finite' by a tableau calculus [PDF]
Le Matematiche, 1995 In this paper we give a decidable tableau calculus for the unquantified theory MLSSF, which involves in addition the constructs of Multilevel Syllogistic, namely 'membership', 'equality', 'set inclusion', 'binary union', 'binary intersection' and 'set ...
Domenico Cantone, Rosa Ruggeri Cannata
doaj +1 more source
Logical Methods in Computer Science, 2017 This paper presents matching logic, a first-order logic (FOL) variant for specifying and reasoning about structure by means of patterns and pattern matching.
Grigore Rosu
doaj +1 more source
Fast Line Segment Detection and Large Scene Airport Detection for PolSAR
Remote Sensing, 2022 In this paper, we propose a fast Line Segment Detection algorithm for Polarimetric synthetic aperture radar (PolSAR) data (PLSD). We introduce the Constant False Alarm Rate (CFAR) edge detector to obtain the gradient map of the PolSAR image, which tests ...
Daochang Wang, Qi Liu, Qiang Yin, Fei Ma
doaj +1 more source
Reality According to Muhammad Baqir Sadr and Mulla Sadra [PDF]
Pizhūhish/hā-yi Falsafī- Kalāmī, 2020 According to Mulla Sadra and his Transcendental Wisdom which considers reality being equal to existence to be a self-evident matter, ontology means recognizing reality.
Hasan Lahootiyan, Jamal Sorush
doaj +1 more source
Classification of Multioperations of Rank 2 by E-precomplete Sets
Известия Иркутского государственного университета: Серия "Математика", 2020 In this paper multioperations defined on a two-element set and their closure operator based on composition operator and the equality predicate branching operator is considered. The composition operator is based on union of sets.
V.I. Panteleev, L.V. Ryabets
doaj +1 more source
Normalisation by Evaluation for Type Theory, in Type Theory [PDF]
Logical Methods in Computer Science, 2017 We develop normalisation by evaluation (NBE) for dependent types based on presheaf categories. Our construction is formulated in the metalanguage of type theory using quotient inductive types.
Thorsten Altenkirch, Ambrus Kaposi
doaj +1 more source
FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems [PDF]
Logical Methods in Computer Science, 2016 A data tree is an unranked ordered tree where each node carries a label from a finite alphabet and a datum from some infinite domain. We consider the two variable first order logic FO2(
Florent Jacquemard +2 more
doaj +1 more source
Efficient Multi-Client Functional Encryption for Conjunctive Equality and Range Queries
IEEE Access, 2022 In multi-client functional encryption (MC-FE) for predicate queries, clients generate ciphertexts of plaintexts $x_{1}, \ldots, x_{n}$ binding with a time period $T$ and store them on a cloud server, and the cloud server receives a function key ...
Kwangsu Lee
doaj +1 more source