This article presents a review of the application of evolutionary computation methods to
solving financial problems. Genetic algorithms, genetic programming, multi-objective …

Deductive inference is usually regarded as being “tautological” or “analytical”: the
information conveyed by the conclusion is contained in the information conveyed by the …

We present an informational view of classical propositional logic that stems from a kind of
informational semantics whereby the meaning of a logical operator is specified solely in …

We present a unifying semantical and proof-theoretical framework for investigating depth-
bounded approximations to Boolean Logic, namely approximations in which the number of …

Today's ontology applications require efficient and reliable description logic (DL) reasoning
services. Expressive DLs usually have high worst case complexity while tractable DLs are …

The great advances in logic in the last century and a half saw a turn from its historical
preoccupation with arguing and reasoning to a preoccupation with mathematics. It was a re …

The AGM theory of belief revision provides a formal framework to represent the dynamics of
epistemic states. In this framework, the beliefs of the agent are usually represented as …

The depth-bounded approach seeks to provide realistic models of reasoners. Recognizing
that most useful logics are idealizations in that they are either undecidable or likely to be …

In this paper we study families of resource aware logics that explore resource restriction on
rules; in particular, we study the use of controlled cut-rule and introduce three families of …

The idea of approximate entailment has been proposed by Schaerf and Cadoli [Tractable
reasoning via approximation, Artif. Intell. 74 (2)(1995) 249–310] as a way of modelling the …