Proving Finite Satisfiability of Deductive Databases

Bry, François and Manthey, Rainer (1987): Proving Finite Satisfiability of Deductive Databases. 1st Workshop on Computer Science Logic (CSL), Karlsruhe, 12.10.-16.10.1987. Börger, Egon (ed.) : In: Lecture Notes in Computer Science - CSL '87 : 1st Workshop on Computer Science Logic, pp. 44-55

Abstract

It is shown how certain refutation methods can be extended into semi-decision procedures that are complete for both unsatisfiability and finite satisfiability. The proposed extension is justified by a new characterization of finite satisfiability. This research was motivated by a database design problem: Deduction rules and integrity constraints in definite databases have to be finitely satisfiable

• Item Type: Conference or Workshop Item (Other)
• Faculties: Mathematics, Computer Science and Statistics > Computer Science
• Subjects: 500 Science > 510 Mathematics
• Language: English