Konstantinos F. Sagonas

Learn More
SLG resolution uses tabling to evaluate nonfloundering normal logic pr ograms according to the well-founded semantics. The SLG-WAM, which forms the engine of the XSB system, can compute in-memory recursive queries an <italic>order of magnitute faster</italic> than current deductive databases. At the same time, the SLG-WAM tightly intergrates Prolog code(More)
This paper describes the XSB system, and its use as an in-memory deductive database engine. XSB began from a Prolog foundation, and traditional Prolog systems are known to have serious deficiencies when used as database systems. Accordingly, XSB has a fundamental bottom-up extension, introduced through tabling (or memoing)[4], which makes it appropriate as(More)
The authors use the results of empirical studies to advance a novel theory of language learning that emphasizes the role of multiple cues and forces in development. The Generative Lexicon presents a novel and exciting theory of lexical semantics that addresses the problem of the "multiplicity of word meaning.". The first formally elaborated theory of a(More)
The use of tabling in logic programming allows bottom-up evaluation to be incorporated in a top-down framework, combining advantages of both. At the engine level, tabling also introduces issues not present in pure top-down evaluation, due to the need for subgoais and answers to access tables during resolution. This article describes the design,(More)
This paper describes the XSB system, and its use as an in-memory deductive database engine. XSB began from a Prolog foundation, and traditional Prolog systems are known to have serious deeciencies when used as database systems. Accordingly, XSB has a fundamental bottom-up extension, introduced through tabling (or memoing) 5], which makes it appropriate as(More)
The well-founded semantics has gained wide acceptance partly because it is a skeptical semantics. That is, the well-founded model posits as unknown atoms which are deemed true or false in other formalisms s u c h as stable models. This skepticism makes the well-founded model not only useful in itself, but also suitable as a basis for other forms of(More)