Results 271 to 280 of about 420,653 (327)
Some of the next articles are maybe not open access.
Abelard’s Treatment of Logical Determinism in Its Twelfth-Century Context
, 2019This article investigates Abelard’s defence of the compatibility between universal bivalence and the existence of future contingent events. It first considers the standard strategy put forward by twelfth-century commentators to solve Aristotle’s dilemma ...
Irene Binini
semanticscholar +1 more source
Determinate logic and the Axiom of Choice
Annals of Pure and Applied Logic, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
On determining symmetries in inputs of logic circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994We propose a method for computing maximal sets of symmetric inputs in logic circuits, using a test generation procedure for single stuck-at faults. The method is enhanced by a heuristic that can be used to identify nonsymmetric inputs and thus reduce the number of inputs for which test generation has to be carried out.
Irith Pomeranz, Sudhakar M. Reddy
openaire +1 more source
Industry-track: System-Level Logical Execution Time for Automotive Software Development
International Conference on Embedded Software, 2022The way how automotive software is developed has rapidly evolved with the introduction of heterogeneous hardware/software architectures. Nevertheless, the requirement for deterministic behavior of safety-critical cause-effect chains persists unchanged ...
Kai-Björn Gemlau +2 more
semanticscholar +1 more source
Overhead-Aware Schedule Synthesis for Logical Execution Time (LET) in Automotive Systems
ACM Symposium on Cloud Computing, 2022The Logical Execution Time (LET) has recently been integrated in multi-core automotive systems to ensure timing and dataflow determinism. Although buffering mechanisms are introduced to incorporate LET semantics, they do not guarantee that tasks are ...
Erjola Lalo +3 more
semanticscholar +1 more source
Linguistics and Philosophy, 1983
Determiners are the basic linguistic expressions relating predicates: ''all P1 are P2'', ''five or more P1 are P2'', ''not enough P1 are P2'', etc.. Within this class are found, in particular, both the traditional and non- standard logical quantifiers.
openaire +3 more sources
Determiners are the basic linguistic expressions relating predicates: ''all P1 are P2'', ''five or more P1 are P2'', ''not enough P1 are P2'', etc.. Within this class are found, in particular, both the traditional and non- standard logical quantifiers.
openaire +3 more sources
The logical form of determiners
Journal of Philosophical Logic, 1995An attempt at finding syntactical means for formulating logical laws obeyed by such natural language determiners as ``many'', ``most'', ``few'', ``more than'', \dots. A special language is introduced which is constructed as an extension of the first-order predicate language; the expressivity of this extension is, however, acquired via mixed use of ...
openaire +2 more sources
Logic for structure determination
Tetrahedron, 1991Abstract A program for structure elucidation of organic molecules is described. The main source of input data relies on NMR carbon-proton correlation spectra. The methodology is illustrated for two indole alkaloids.
Jean-Marc Nuzillard, Massiot Georges
openaire +1 more source
Locally Determined Logic Programs
1999In general, the set of stable models of a recursive propositional logic program can be quite complex. For example, it follows from results of Marek, Nerode, and Remmel [8] that there exists finite predicate logic programs and recursive propositional logic programs which have stable models but no hyperarithmetic stable models.
Douglas A. Cenzer +2 more
openaire +1 more source