In fuzzy logic in wider sense, i.e. in the field of fuzzy sets applications, t-norms got a prominent rôle in recent times. In many-valued logic, the Lukasiewicz systems, the Gödel sytems, and also the product logic all are t-norm based systems. The present paper discusses the more general problem of the adequate axiomatizability for such t-norm based logical systems in general, surveying result...

Possibilistic conditional independence is in­ vestigated : we propose a definition of this notion similar to the one used in probability theory. The links between independence and no-interactivity are investigated, and proper­ ties of these relations are given. The influ­ ence of the conjunction used to define a con­ ditional measure of possibility is also high­ lighted : we examine three types...

The LLA Retina combines Lukasiewicz logic arrays (LLAs) with photo-sensor clusters to work as a fuzzy edge detection mechanism and several other applications. In this presentation we have explored various approaches to excite and evaluate the device with several types of light sources including visible and infra-red laser beams. Based on the detailed studies on the device, one particular config...

We present logic programming style “goal-directed” proof methods for Lukasiewicz logic L that both have a logical interpretation, and provide a suitable basis for implementation. We introduce a basic version, similar to goal-directed calculi for other logics, and make refinements to improve efficiency and obtain termination. We then provide an algorithm for fuzzy logic programming in Rational P...

We present the agent programming language GTGolog, which integrates explicit agent programming in Golog with game-theoretic multi-agent planning in Markov games. It is a generalization of DTGolog to a multi-agent setting, where we have two competing single agents or two competing teams of agents. The language allows for specifying a control program for a single agent or a team of agents in a hi...

This paper is directed towards an infrastructure for handling both uncertainty and vagueness in the Rules, Logic, and Proof layers of the Semantic Web. More concretely, we present probabilistic fuzzy description logic programs, which combine fuzzy description logics, fuzzy logic programs (with stratified nonmonotonic negation), and probabilistic uncertainty in a uniform framework for the Semant...

We propose a parameterized framework based on a Heyting algebra and Lukasiewicz negation for modeling uncertainty for belief. We adopt a probability theory as mathematical formalism for manipulating uncertainty. An agent can express the uncertainty in her knowledge about a piece of information in the form of belief types: as a single probability, as an interval (lower and upper boundary for a p...

Lukasiewicz logic arrays (LLAs) are analog VLSI circuits structured as trees of continuous-valued implications. First described in 1990, LLAs are now nding uses as applicationspeci c array processors for image processing, fuzzy inference, and robotic control. Yet an early question persists: Why do LLAs work? Intuitively, a small error should build up through successive implications of an arbitr...

Fuzzy answer set programming (FASP) combines two declarative frameworks, answer set programming and fuzzy logic, in order to model reasoning by default over imprecise information. Several connectives are available to combine different expressions; in particular the Gödel and Lukasiewicz fuzzy connectives are usually considered, due to their properties. Although the Gödel conjunction can be easi...

Lukasiewicz’s infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Lukasiewicz algebra on the unit real interval. In the literature a deductive system axiomatized in a Hilbert style was associated to it, and was later shown to be semantically defined from Lukasiewicz algebra by using a “truthpreserving” scheme. This deductive system...