We introduce the declarative programming language Indeed that uses both deduction and interaction through multi-agent system applications. The language design is addressed by providing a uniform programming model that combines two refinements of resolution along with some control strategies to introduce state-based descriptions. We show that the logical calculus in which the computational model...

Constraint propagation is a matter of logical deduction, but this is not usually sufficient to reach a solution to a problem. Heuristic knowledge is usually needed to go on with the solution search when logical deduction becomes inefficient. The way this second type of knowledge is handled has more to do with decision rather than deduction. In this paper we suggest a mechanism to handle heurist...

This article considers a method of data mining from text documents by using logical deduction rules. This algorithm is used in information processing of heterogeneous sources. The method allows to mark out a set of data objects from a flow of semistructured full-text information, presented in natural languages, links between data flows, and to form a repository of factual information. This algo...

The worst-case complexity of cut elimination in sequent calculi for first order based logics is investigated in terms of the increase in logical depth of the deduction. It is shown that given a calculus satisfying a general collection of sufficient conditions for cut elimination and given a deduction with cuts, there exists a cut free deduction with a logical depth, in the worst case, hyper-exp...

The work concerns automatic generation of logical specifications from requirements models. Logical specifications obtained in such a way can be subjected to formal verification using deductive reasoning. Formal verification concerns correctness of a model behaviour. Reliability of the requirements engineering is essential for all phases of software development processes. Deductive reasoning is ...

In this paper we discuss Gabbay’s idea of basing nonmonotonic deduction on semantic consequence in intuitionistic logic extended by a consistency operator and Turner’s suggestion of replacing the intuitionistic base system by Kleene’s three-valued logic. It is shown that a certain counterintuitive feature of these approaches can be avoided by using Nelson’s constructive logic N instead of intui...

1 Introduction In this paper we provide very broad notions of deduction and consequence for logic programs (so-called LP-deduction relations and LP-consequence relations), and we prove that under very modest assumptions, an LP-deduction relation will be either unsound or incomplete with respect to every LP-consequence relation. Throughout this paper we assume a non-logical alphabet, K, which in...

The paper discusses work in progress on developing a tabular deduction method for multimodal logical grammar. The method is based on a compilation procedure, a single elimination rule for multiplicative and additive (t) binary operators, and two rules defining residuation for the unary modals i/ #i . The method aims to achieve for multimodal logical grammar what chart-based parsing does for CFG...