Results 111 to 120 of about 612 (145)

Extending Removed Sets Revision to partially preordered belief bases [PDF]

International Journal of Approximate Reasoning, 2011
National audienceMost of belief revision operations have been proposed for totally preordrered information. However, in case of partial ignorance, pieces of information are partially preordered and few effective approaches of revision have been proposed.
Pierre Drap
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

IF-preorder, IF-topology and IF-automata

International Journal of Machine Learning and Cybernetics, 2013
The concept of topologies are widely used in machine learning, and fuzzy automata are used as models of machine learning systems. An advantage of employing fuzzy automaton as a model of machine learning system is its simplicity in design and computation.
S. P. Tiwari, Anupam K. Singh
openaire   +2 more sources

Positive Preorders

Algebra and Logic, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

An efficiency preorder for processes

Acta Informatica, 1991
A simple efficiency preorder for CCS processes is introduced in which \(p\preceq q\) means that \(q\) is at least as fast as \(p\), or more generally, \(p\) uses at least as much resources as \(q\). It is shown to be preserved by all CCS contexts except summation and it is used to analyse a non-trivial example: two different implementations of a ...
S. Arun-Kumar, Matthew Hennessy
openaire   +4 more sources

Insertion and extension theorems for lattice-valued functions on preordered topological spaces [PDF]

Topology and Its Applications, 2011
In this paper, the possibility of inserting an increasing continuous lattice-valued function between two comparable semicontinuous functions is studied.
M A de Prada Vicente, J Gutierrez Garcia   +1 more
exaly   +2 more sources

The Must Preorder Revisited

2007
We define a language for Web services contracts as a parallel-free fragment of ccs and we study a natural notion of compliance between clients and services in terms of their corresponding contracts. The induced contract preorder turns out to be valuable in searching and querying registries of Web services, it shows interesting connections with the must
C. Laneve, L. Padovani
openaire   +3 more sources

On fuzzy syntopogenous structures and preorder

Fuzzy Sets and Systems, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mo Zhi Wen, Liu Wang Jin, Shu Lan
openaire   +1 more source

How to Revise a Total Preorder

Journal of Philosophical Logic, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard Booth 0001, Thomas Andreas Meyer
openaire   +2 more sources

Performance preorder and competitive equivalence

Acta Informatica, 1997
A preorder based on execution speed, called performance preorder, is introduced for a simple process algebra with durational actions. Two processes \(E\) and \(F\) are related -- \(E\sqsubseteq_p F\) -- if they have the same functionality (in this case, we have chosen strong bisimulation equivalence) and \(E\) is at least as fast as \(F\).
Corradini F., Gorrieri R., Roccetti M.
openaire   +2 more sources

Galois Connections Between a Fuzzy Preordered Structure and a General Fuzzy Structure

IEEE Transactions on Fuzzy Systems, 2018
We continue the study of (isotone) Galois connections, also called adjunctions, in the framework of fuzzy preordered structures, which generalize fuzzy preposets by considering underlying fuzzy equivalence relations.
Inmaculada de Las Peñas Cabrera, Garcia-Pardo Francisca, Bernard de Baets   +2 more
exaly   +2 more sources