We report on a method of automated hypothesis generation, called f-resolution, which is derived from deductive resolution techniques. The method is inductive in character, in the sense that given input statement E, it generates hypotheses H, such that E is a deductive consequence of E. The method is extended by a generalized unification algorithm which introduces appropriate identity assumption...

Deductive object bases are a combination of both deductive and objectoriented databases. This dissertation investigates the problem of update control for such databases. The data model is defined as an extreme case of a deductive database with only one extensional predicate and a multitude of axioms defining the object-oriented abstraction concepts. The advantages are twofold: a distinct concep...

In the context of deductive program verification, supporting floatingpoint computations is tricky. We propose an expressive language to formally specify behavioral properties of such programs. We give a first-order axiomatization of floating-point operations which allows to reduce verification to checking the validity of logic formulas, in a suitable form for a large class of provers including ...

1. GRADED DEDUCTIVE TOOLS FOR GRADED INFORMATION In accordance with Tarski’s point of view, we identify a crisp deductive apparatus with a “deduction operator”, i.e. a closure operator D : P(Å)→ P(Å) where Å is the set of formulas in a logic. Given a set X of formulas, we interpret D(X) as the set of logical consequences of X. Now, we can imagine a "stratified" deduction apparatus, i.e. the ava...

on (Constraint) Logic Programming and 24th International Workshop on Functional and (Constraint) Logic Programming (WLP’15/’16/WFLP’16). EPTCS 234, 2017, pp. 42–56, doi:10.4204/EPTCS.234.4 c © F. Nogatz & D. Seipel This work is licensed under the Creative Commons Attribution License. Implementing GraphQL as a Query Language for Deductive Databases in SWI–Prolog Using DCGs, Quasi Quotations, and...