Sciweavers

91 search results - page 4 / 19
» Reducts of Propositional Theories, Satisfiability Relations,...
Sort
View
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
14 years 2 months ago
Relational parametricity for references and recursive types
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Lars Birkedal, Kristian Støvring, Jacob Tha...
BIRTHDAY
2000
Springer
13 years 10 months ago
Prioritizing Default Logic
A number of prioritized variants of Reiter’s default logic have been described in the literature. In this paper, we introduce two natural principles for preference handling and s...
Gerhard Brewka, Thomas Eiter
AIMSA
2000
Springer
13 years 10 months ago
Least Generalization under Relative Implication
Inductive Logic Programming (ILP) deals with inducing clausal theories from examples basically through generalization or specialization. The specialization and generalization oper...
Svetla Boytcheva
ECSQARU
2009
Springer
14 years 10 days ago
Merging Belief Bases Represented by Logic Programs
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
Julien Hué, Odile Papini, Eric Würbel
FOSSACS
2000
Springer
13 years 9 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