• Publications
  • Influence
First-order syntactic characterizations of minimal entailment, domain-minimal entailment, and Herbrand entailment
  • M. Suchenek
  • Mathematics, Computer Science
  • Journal of Automated Reasoning
  • 1 June 1993
AbstractThis paper investigates a consistent versioncwasof Reiter's closed-world assumptioncwa. It provides a syntactic characterization of minimal entailment ⊢min: for every ∨-sentence ϕ and forExpand
  • 18
  • 1
Forcing versus Closed World Assumption
  • 10
Incremental models of updating data bases
  • M. Suchenek
  • Computer Science
  • Algebraic Logic and Universal Algebra in Computer…
  • 1 June 1988
This paper introduces a generalization of weak model-theoretic forcing of [Rob71] and [Kei73]. This generalized forcing preserves classic properties of weak model-theoretic forcing, e.g. Generic SetExpand
  • 7
A Syntactic Characterization of Minimal Entailment
This paper investigates a consistent versions cwaS of sometimes inconsistent Reiter’s closed world assumption cwa, proving (theorem 4.3) that for every ∀-sentence φ and for every ∀-theory Σ, φ ∈Expand
  • 10
  • Open Access
Programmable pulse generator based on programmable logic and direct digital synthesis.
The paper presents a new approach of pulse generation which results in both wide range tunability and high accuracy of the output pulses. The concept is based on the use of programmable logic andExpand
  • 10
  • Open Access
Applications of Lyndon Homomorphism Theorems to the Theory of Minimal Models
  • M. Suchenek
  • Mathematics, Computer Science
  • Int. J. Found. Comput. Sci.
  • 1 March 1990
This paper contains, among others, a concise proof (proof 6.2) of the following fact (theorem 2.7): For every ∀∪Neg-theory Σ and every positive sentence φ, It is demonstrated in this paper (corollaryExpand
  • 7
On Negative Information in Deductive Databases
An overview of deductive databases with an emphasis on problems related to negative information is presented. The subject is embedded into the wider context of logic programming, exposing certainExpand
  • 8
  • Open Access
Preservation properties in deductive databases
  • M. Suchenek
  • Computer Science
  • Methods Log. Comput. Sci.
  • 1 March 1994
This paper constitutes a brief study of the following scheme DAΓ of default reasoning: Given set of premises Σ, assume φ if and only if, for every γ ∈ Γ, Σ ∪ {φ} does not entail γ unless Σ does,Expand
  • 5
  • Open Access
Elementary Yet Precise Worst-Case Analysis of Floyd's Heap-Construction Program
  • M. Suchenek
  • Mathematics, Computer Science
  • Fundam. Informaticae
  • 2012
The worst-case behavior of the heap-construction phase of Heapsort escaped mathematically precise characterization by a closed-form formula for almost five decades. This paper offers a proof that theExpand
  • 2
On Undecidability of Non-monotonic Logic
The degree of undecidability of nonmonotonic logic is investigated. A proof is provided that arithmetical but not recursively enumerable sets of sentences definable by nonmonotonic default logic areExpand
  • 2
  • Open Access