Interconnections are increasingly one of the dominant contributors to delay, area and energy consumption in CMOS digital circuits now a days. Multiple Valued Logic (MVL) can decrease the average power required for level transitions and also the number of required interconnections are reduced. So the impact of interconnections on overall energy consumption is reduced. In this paper, a quaternary...

Introduction Markov Logic Networks (Domingos and Lowd 2009) (MLNs) use a few weighted first-order logic formulas to represent large probabilistic graphical models and are ideally suited for representing both relational and probabilistic knowledge in a wide variety of application domains such as, NLP, computer vision, and robotics. However, inference in them is hard because the graphical models ...

B o t t o m u p evaluation of logic programs has recently at tracted much attention in the logic programming and the deductive database field. It is complete [7], and if the number of all possible facts is finite, it is guaranteed to terminate, while t op -down evaluation may not. B o t t o m u p evaluation, however, may be inefficient since it may generate many facts irrelevant to the query. T...

Masked logic styles use a random mask bit to de-correlate the power consumption of the circuit from the state of the algorithm. The effect of the random mask bit is that the circuit switches between two complementary states with a different power profile. Earlier work has shown that the mask-bit value can be estimated from the power consumption profile, and that masked logic remains susceptible...

Traditionally logic was considered as having two branches: deductive and inductive. However the development of the subject from Frege (1879) up to about 1970 brought about a divergence between deductive and inductive logic. It is argued in this paper that developments in artiicial intelligence in the last twenty or so years (particularly logic programming and machine learning) have created a ne...

Issues about information spring up wherever one scratches the surface of logic. Here is a case that raises delicate issues of ‘factual’ versus ‘procedural’ information, or ‘statics’ versus ‘dynamics’. What does intuitionistic logic, perhaps the earliest source of informational and procedural thinking in contemporary logic, really tell us about information? How does its view relate to its ‘cousi...

Extended abduction introduced by Inoue and Sakama ( 1995 ) generalizes traditional abduction in the sense that it can compute negative explanations by removing hypotheses from a nonmonotonic background theory, rather than only adding them. Also, it has a mechanism of computing anti-explanations to unexplain negative observations. Such extended abduction not only enhances reasoning ability of tr...

In this paper we present a novel methodology to compute stable models in Answer Set Programming. The process is performed with a bottom-up approach that does not require the preprocessing of the typical grounding phase. The implementation is completely in Prolog and Constraint Logic Programming over finite domains.

An approach to clustering is presented that adapts the basic top-down induction of decision trees method towards clustering. To this aim, it employs the principles of instance based learning. The resulting methodology is implemented in the TIC (Top down Induction of Clustering trees) system for first order clustering. The TIC system employs the first order logical decision tree representation o...

In this paper we suggest a mechanism that improves significantly the performance of a top-down inductive logic programming (ILP) learning system. This improvement is achieved at the cost of giving to the system extra information that is not difficult to formulate. This information appears in the form of an algorithm sketch: an incomplete and somewhat vague representation of the computation rela...