Knowledge representation (KR) is actually more than representation: It involves also inference, namely inference of “new” knowledge, i.e. new facts. Logic programming is a suitable KR medium, but more often than not discussions on this programming paradigm focus on aspects other than KR. In this paper, I elaborate on the general theory of logic programming and give the essentials of two of its main implementations, to wit, Prolog and Datalog, from the viewpoint of deductive computing over knowledge bases, which (...) includes deductive programming. (shrink)

The generalized conclusion of the Tarski and Gödel proofs: All formal systems of greater expressive power than arithmetic necessarily have undecidable sentences. Is not the immutable truth that Tarski made it out to be it is only based on his starting assumptions. -/- When we reexamine these starting assumptions from the perspective of the philosophy of logic we find that there are alternative ways that formal systems can be defined that make undecidability inexpressible in all of these formal systems.

This sentence G ↔ ¬(F ⊢ G) and its negation G ↔ ~(F ⊢ ¬G) are shown to meet the conventional definition of incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ)). They meet conventional definition of incompleteness because neither the sentence nor its negation is provable in F (or any other formal system). -- .

Zum Kant-Jahr: Manfed Kühns meisterhafte Biographie so preist der Verlag C. H. Beck im Buchumschlag seine 2004 in fünfter Auflage erschienene Übersetzung von Manfred Kuehns Kant. A Biography. Cambridge University Press 2001 an. Nun, 2018, habe ich eben diese Jubiläumsausgabe zu Weihnachten, dem Fest der Geburt des Immanuel, geschenkt bekommen. Kant wurde am 22. April 1724 in Königsberg geboren und starb dort am 12. Februar 1804. 2018 kann kaum oder gar nicht als Kant-Jahr gelten. Doch ein katholischer Kalender verbindet mit (...) dem 25. Dezember den Namen Immanuel, Gott (ist) mit uns. Kant hat also Namenstag. (shrink)

While situation theory and situation semantics provide an appropriate framework for a realistic model-theoretic treatment of natural language, serious thinking on their 'computational' aspects has just started. Existing proposals mainly offer a Prolog- or Lisp-like programming environment with varying degrees of divergence from the ontology of situation theory. In this paper, we introduce a computational medium (called BABY-SIT) based on situations. The primary motivation underlying BABY-SIT is to facilitate the development and testing of programs in domains ranging from linguistics (...) to artificial intelligence in a unified framework built upon situation-theoretic constructs. (shrink)

While situation theory and situation semantics provide an appropriate framework for a realistic model-theoretic treatment of natural language, serious thinking on their 'computational' aspects has only recently started. Existing proposals mainly offer a Prolog- or Lisp-like programming environment with varying degrees of divergence from the ontology of situation theory. In this paper, we introduce a computational medium (called BABY-SIT) based on situations. The primary motivation underlying BABY-SIT is to facilitate the development and testing of programs in domains ranging from (...) linguistics to artificial intelligence in a unified framework built upon situation-theoretic constructs. (shrink)