We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been ...
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
Abstract. This paper reviews and relates two default reasoning mechanisms, lexicographic (lex) and maximum entropy (me) entailment. Meentailment requires that defaults be assigned ...
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
We recall the concept of a linguistic variable and the representation of its values (i.e. linguistic terms) by means of fuzzy sets. In this framework adverbs are represented by fuz...