Results 21 to 30 of about 8,631,344 (363)
Дискурс, 2020 Introduction. The article continues the series of publications on the linguistics of relations (hereinafter R–linguistics) and is devoted to an introduction to the logic of natural language in relation to the approach considered in the series.
O. M. Polyakov
doaj +1 more source
FLP Semantics Without Circular Justifications for General Logic Programs
AAAI Conference on Artificial Intelligence, 2012 The FLP semantics presented by (Faber, Leone, and Pfeifer 2004) has been widely used to define answer sets, called FLP answer sets, for different types of logic programs such as logic programs with aggregates, description logic programs (dl-programs),
Yi-Dong Shen, Kewen Wang
semanticscholar +1 more source
Satisfiability vs. Finite Satisfiability in Elementary Modal Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our attention to finite ...
Jakub Michaliszyn +2 more
doaj +1 more source
Neutrosophic Logic - a Generalization of the Intuitionistic Fuzzy Logic [PDF]
SSRN Electronic Journal, 2016 7 pages. Presented to the Special Session on Intuitionistic Fuzzy Sets and Related Concepts, of International EUSFLAT Conference, Zittau/G\"orlitz, Germany, 10-12 September ...
Florentin Smarandache +1 more
openaire +3 more sources
Model Checking Linear Logic Specifications [PDF]
, 2003 The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications.
Bozzano, M., Delzanno, G., Martelli, M.
core +1 more source
MoSeL: a general, extensible modal framework for interactive proofs in separation logic
Proc. ACM Program. Lang., 2018 A number of tools have been developed for carrying out separation-logic proofs mechanically using an interactive proof assistant. One of the most advanced such tools is the Iris Proof Mode (IPM) for Coq, which offers a rich set of tactics for making ...
Robbert Krebbers +7 more
semanticscholar +1 more source
Theoretical Computer Science, 2009 We introduce term-generic logic (TGL), a first-order logic parameterized with terms defined axiomatically (rather than constructively), by requiring terms to only provide free variable and substitution operators satisfying some reasonable axioms. TGL has a notion of model that generalizes both first-order models and Henkin models of the λ-calculus. The
Popescu, Andrei, Rosu, Grigore
openaire +3 more sources
PSPACE Bounds for Rank-1 Modal Logics [PDF]
, 2006 For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal logics.
Pattinson, Dirk, Schröder, Lutz
core +7 more sources
Internal Calculi for Separation Logics [PDF]
, 2020 We present a general approach to axiomatise separation logics with heaplet semantics with no external features such as nominals/labels. To start with, we design the first (internal) Hilbert-style axiomatisation for the quantifier-free separation logic SL(
, Lozes, Etienne, Mansutti, Alessio
core +2 more sources
Digital logic gates in soft, conductive mechanical metamaterials
Nature Communications, 2021 Integrated circuits utilize networked logic gates to compute Boolean logic operations that are the foundation of modern computation and electronics.
Charles El Helou +3 more
semanticscholar +1 more source