Results 71 to 80 of about 510,140 (296)

Computing stable models by program transformation [PDF]

open access: yes, 1993
In analogy to the Davis--Putnam procedure we develop a new procedure for computing stable models of propositional normal disjunctive logic programs, using case analysis and simplification. Our procedure enumerates all stable mofels without repetition and
Stuber, J.
core   +1 more source

MINIMIZATION LOGICAL FUNCTION BY METHOD TO ALTERNATIVE ADAPTATION

open access: yesВестник Донского государственного технического университета, 2018
Approach is offered In article to minimization boolean function, founded on use automaton to adaptation. As bases is used known method to minimization boolean function, founded on partition implicant units made disjunctive normal form boolean function on
Y.O. CHERNYSHEV, N.N. VENCOV
doaj  

Interpretable Multiclass Models for Corporate Credit Rating Capable of Expressing Doubt

open access: yesFrontiers in Applied Mathematics and Statistics, 2016
Corporate credit rating is a process to classify commercial enterprises based on their creditworthiness. Machine learning algorithms can construct classification models, but in general they do not tend to be 100% accurate.
Lennart Obermann, Stephan Waack
doaj   +1 more source

The Prevent Counter‐Terrorism Strategy After Southport

open access: yesThe Political Quarterly, EarlyView.
Abstract The counter‐terrorism Prevent Strategy has recently undergone a significant government review by David Anderson KC following the 2024 murders in Southport. The attacker was referred three times to Prevent without being engaged because he was deemed not to be susceptible to terrorist ideologies.
Paul Thomas
wiley   +1 more source

A study of fuzzy and many-valued logics in cellular automata

open access: yes, 2007
In this paper we provide an analytical study of the theory of multi-valued and fuzzy cellular automata where the fuzziness appears as the result of the application of an underlying multi-valued or continuous logic as opposed to standard logic as used ...
Mingarelli, Angelo B.
core   +3 more sources

Fiscal grievance politics: wealth taxation and master‐race democracy in post‐coup Bolivia Politique des griefs fiscaux : impôt sur la fortune et démocratie de la race maîtresse en Bolivie post‐coup d’État

open access: yesJournal of the Royal Anthropological Institute, EarlyView.
This article analyses a new wealth tax (the IGF) in Bolivia against the backdrop of the 2019 ousting of former president Evo Morales. In doing so, it engages calls for ‘a return to politics’ in anthropology by proposing the notion of a ‘fiscal grievance politics’ as animating elite opposition to the tax in lowland Santa Cruz department. I show that the
Charles Dolph
wiley   +1 more source

Logical optimization of Boolean nets using Shannon expansion

open access: yesInformatika, 2019
A synthesis of logical circuits, comprising functional combination blocks of very large scale integration circuits, is one of the most important tasks of computer-aided design.
P. N. Bibilo, Yu. Y. Lankevich
doaj  

Base-free Formulas in the Lattice-theoretic Study of Compacta [PDF]

open access: yes, 2011
The languages of finitary and infinitary logic over the alphabet of bounded lattices have proven to be of considerable use in the study of compacta. Significant among the sentences of these languages are the ones that are base free, those whose truth is ...
Bankston, Paul
core   +1 more source

Fronting in Old Catalan: Asymmetries between Narration and Reported Speech1

open access: yesTransactions of the Philological Society, Volume 123, Issue 1, Page 1-28, March 2025.
Abstract This article explores the distribution, syntax, and information structure of XVS clauses in the narrative text and the reported speech of a thirteenth‐century Old Catalan chronicle, the Llibre dels Fets. It is shown that XVS occurs mainly within reported speech and in embedded clauses.
Afra Pujol i Campeny
wiley   +1 more source

MINIMIZING THE MULTILEVEL REPRESENTATIONS OF SYSTEMS OF BOOLEAN FUNCTIONS BASED ON SHANNON DECOMPOSITION

open access: yesInformatika, 2017
A locally optimal algorithm is proposed to form a permutation of variables, which are used to obtain successive Shannon decompositions of a system of disjunctive normal forms of completely specified Boolean functions.
P. N. Bibilo, Y. Y. Lankevich
doaj  

Home - About - Disclaimer - Privacy