Sciweavers

345 search results - page 30 / 69
» Kripke models for classical logic
Sort
View
108
Voted
SLP
1994
89views more  SLP 1994»
15 years 1 months ago
Signed Logic Programs
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
Hudson Turner
LPNMR
1993
Springer
15 years 4 months ago
An Assumption-Based Framework for Non-Monotonic Reasoning
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...
Andrei Bondarenko, Francesca Toni, Robert A. Kowal...
107
Voted
FM
2003
Springer
98views Formal Methods» more  FM 2003»
15 years 5 months ago
Generating Counterexamples for Multi-valued Model-Checking
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model...
Arie Gurfinkel, Marsha Chechik
129
Voted
CORR
2006
Springer
131views Education» more  CORR 2006»
15 years 15 days ago
Intensional Models for the Theory of Types
In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general m...
Reinhard Muskens
AAAI
2008
15 years 1 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor