Sciweavers

345 search results - page 42 / 69
» Kripke models for classical logic
Sort
View
TCS
2002
13 years 7 months ago
Martin's game: a lower bound for the number of sets
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...
M. Ageev
FUZZIEEE
2007
IEEE
13 years 11 months ago
A Linguistic Multi-level Weighted Query Language to Represent User Information Needs
An ordinal fuzzy linguistic Information Retrieval System (IRS) based on a multi-level weighting scheme to represent the user queries, in a more flexible way, is proposed. The IRS a...
Enrique Herrera-Viedma, Antonio Gabriel Lóp...
SPIN
2004
Springer
14 years 1 months ago
Model-Driven Software Verification
Abstract. In the classic approach to logic model checking, software verification requires a manually constructed artifact (the model) to be written in the language that is accepted...
Gerard J. Holzmann, Rajeev Joshi
AI
2008
Springer
13 years 7 months ago
On the notion of concept I
It is well known that classical set theory is not expressive enough to adequately model categorization and prototype theory. Recent work on compositionality and concept determinat...
Michael Freund
ICLP
1991
Springer
13 years 11 months ago
Nonmonotonic Reasoning with Well Founded Semantics
Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the W...
Luís Moniz Pereira, Joaquim Nunes Apar&iacu...