Results 241 to 250 of about 47,472 (286)

An Exact Method for Reliable Shortest Path Problems With Correlation

Networks, EarlyView.
ABSTRACT Shortest path problems often arise in contexts where travel times are uncertain. In these settings, reliable paths are often valued more than paths with lower expected travel times. This has led to several variants of reliable shortest path problems (RSPP) that handle travel time reliability differently. We propose an algorithmic framework for
Esteban Leiva, Santiago Morales, Daniel Yamín, Andrés L. Medaglia   +3 more
wiley   +1 more source

Quantum Collapse and Computation in an Everett Multiverse. [PDF]

Entropy (Basel)
Tamburini F, Licata I.
europepmc   +1 more source

Cajal's legacy in the digital era: from neuroscience foundations to deep learning. [PDF]

Front Neuroanat
García-Lorenzo M, Herreras O, DeFelipe J.   +2 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

The Propositional Formula Checker HeerHugo

Journal of Automated Reasoning, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Groote, J.F., Warners, J.P.
openaire   +1 more source

Reducing signed propositional formulas

Soft Computing - A Fusion of Foundations, Methodologies and Applications, 1999
New strategies of reduction for finite-valued propositional logics are introduced in the framework of the TAS1 methodology developed by the authors [1]. A new data structure, the Δ^-sets, is introduced to store information about the formula being analysed, and its usefulness is shown by developing efficient strategies to decrease the size of signed ...
G. Aguilera, I. P. de Guzmán, M. Ojeda-Aciego, A. Valverde   +3 more
openaire   +1 more source

Vivifying Propositional Clausal Formulae

2008
In this paper, we present a new way to preprocess Boolean formulae in Conjunctive Normal Form (CNF). In contrast to most of the current pre-processing techniques, our approach aims at improving the filtering power of the original clauses while producing a small number of additional and relevant clauses. More precisely, an incomplete redundancy check is
Piette Cédric, Hamadi Youssef, Saïs Lakhdar   +2 more
openaire   +1 more source

CONJUNCTIVELY INDECOMPOSABLE FORMULAS IN PROPOSITIONAL CALCULI

Mathematics of the USSR-Izvestiya, 1969
Formulas in intuitionistic propositional calculus and its subsystems are studied that cannot be decomposed into a proper conjunction.
openaire   +2 more sources

Algorithms for computing backbones of propositional formulae [PDF]

AI Communications, 2015
The problem of propositional satisfiability (SAT) has found a number of applications in both theoretical and practical computer science. In many applications, however, knowing a formula's satisfiability alone is insufficient. Often, some other properties of the formula need to be computed.
Janota, Mikoláš, Lynce, Inês, Marques-Silva, Joao   +2 more
openaire   +1 more source

Classification of derivable propositional formulas

Mathematical Notes of the Academy of Sciences of the USSR, 1972
This article considers questions connected with the derivability of propositional formulas under restrictions on the length of the derivation. A classification is proposed for formulas with minimum derivation length.
openaire   +2 more sources

Scalable formula decomposition for propositional satisfiability

Proceedings of the Third C* Conference on Computer Science and Software Engineering, 2010
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or probabilistic reasoning. The depth-first search DPLL procedure is in practice the most efficient complete algorithm to date.
Anthony Monnet, Roger Villemaire
openaire   +1 more source