Sciweavers

254 search results - page 21 / 51
» Answer Sets for Propositional Theories
Sort
View
APAL
2005
154views more  APAL 2005»
14 years 9 months ago
A Sahlqvist theorem for distributive modal logic
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
Mai Gehrke, Hideo Nagahashi, Yde Venema
CORR
2002
Springer
85views Education» more  CORR 2002»
14 years 9 months ago
The partition semantics of questions, syntactically
Groenendijk and Stokhof (1984, 1996; Groenendijk 1999) provide a logically attractive theory of the semantics of natural language questions, commonly referred to as the partition t...
Chung-chieh Shan, Balder ten Cate
63
Voted
APAL
2008
63views more  APAL 2008»
14 years 9 months ago
A standard model of Peano arithmetic with no conservative elementary extension
The principal result of this paper answers a long-standing question in the model theory of arithmetic [KS, Question 7] by showing that there exists an uncountable arithmetically cl...
Ali Enayat
ICFP
2008
ACM
15 years 9 months ago
Pattern minimization problems over recursive data types
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Alexander Krauss
98
Voted
FOSSACS
2000
Springer
15 years 1 months ago
A Program Refinement Framework Supporting Reasoning about Knowledge and Time
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
Kai Engelhardt, Ron van der Meyden, Yoram Moses