Results 211 to 220 of about 45,065 (245)

Engineered biological neuronal networks as basic logic operators. [PDF]

Front Comput Neurosci
Küchler J, Vulić K, Yao H, Valmaggia C, Ihle SJ, Weaver S, Vörös J.   +6 more
europepmc   +1 more source

Substation Inspection Safety Risk Identification Based on Synthetic Data and Spatiotemporal Action Detection. [PDF]

Sensors (Basel)
Liu C, Zhang W, Xu W, Lu B, Li W, Zhao X.   +5 more
europepmc   +1 more source

Identification and Visualization Textile Fibers by Raman Imaging. [PDF]

Materials (Basel)
Liu K, Chen H.
europepmc   +1 more source

Monolithically integrated solid-state vertical organic electrochemical transistors switching between neuromorphic and logic functions. [PDF]

Sci Adv
Li T, Qu Z, Si J, Lee Y, Bandari VK, Schmidt OG.   +5 more
europepmc   +1 more source

Synthetic consciousness architecture. [PDF]

Front Robot AI
Spasokukotskiy K.
europepmc   +1 more source

Prefixed Resolution: A Resolution Method for Modal and Description Logics [PDF]

, 1999
We provide a resolution-based proof procedure for modal and description logics that improves on previous proposals in a number of important ways. First, it avoids translations into large undecidable logics, and works directly on modal or description logic formulas instead.
de Rijke, M., Areces, C.E., de Nivelle, J.M.G.G.   +2 more
openaire   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Resolution in Modal, Description and Hybrid Logic

Journal of Logic and Computation, 2001
We provide a resolution-based proof procedure for modal, description and hybrid logic that improves on previous proposals in important ways. It avoids translations into large undecidable logics, and works directly on modal, description or hybrid logic formulas instead.
Areces, C.E., de Nivelle, J.M.G.G., de Rijke, M.   +2 more
openaire   +7 more sources

Resolution with Order and Selection for Hybrid Logics

Journal of Automated Reasoning, 2010
We investigate labeled resolution calculi for hybrid logics with inference rules restricted via selection functions and orders. We start by providing a sound and refutationally complete calculus for the hybrid logic $\mathcal{H}(@,{\downarrow},\mathsf{A})$, even under restrictions by selection functions and orders.
Areces, Carlos, Gorin, Daniel
openaire   +4 more sources

Extending resolution to resolution logics

Journal of Experimental & Theoretical Artificial Intelligence, 1991
Abstract In previous papers (O'Hearn & Stachniak 1989b, Stachniak & O'Hearn 1990, Stachniak 1989,1990a) we proposed an algebraic methodological framework for the introduction and analysis of resolution proof systems for finitely-valued logical calculi. In the present paper we extend this approach to a wider class of the so-called resolution logics.
openaire   +2 more sources

Propositional Resolution Logics [PDF]

, 1996
In this chapter, we provide a characterization of the class of propositional resolution logics and delineate the distinct character of resolution logics with strong resolution counterparts. We also study resolution counterparts of disjunctive logics and show that in the presence of disjunction, the deductive process can be based on a single-conclusion ...
openaire   +1 more source