Sciweavers

2920 search results - page 23 / 584
» Finite information logic
Sort
View
AIML
2004
13 years 11 months ago
Utilitarian Deontic Logic
This paper aims to examine Horty's proposal of utilitarian deontic logic [7]. It will focus on his dominance operators by way of simplified semantics. An axiomatization of the...
Yuko Murakami
PACT
2007
Springer
14 years 4 months ago
Orthogonal Organized Finite State Machine Application to Sensor Acquired Information
The application of the Orthogonal Organized Finite State Machine (OOFSM) to the representation of data acquired by sensor networks is proposed. The OOFSM was proposed in earlier wo...
Brian J. d'Auriol, John Kim, Sungyoung Lee, Young-...
FFA
2006
69views more  FFA 2006»
13 years 9 months ago
Information sets and partial permutation decoding for codes from finite geometries
We determine information sets for the generalized Reed-Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also ...
Jennifer D. Key, T. P. McDonough, Vassili C. Mavro...
CADE
2000
Springer
14 years 2 months ago
Two Techniques to Improve Finite Model Search
Abstract. This article introduces two techniques to improve the propagation efficiency of CSP based finite model generation methods. One approach consists in statically rewriting ...
Gilles Audemard, Belaid Benhamou, Laurent Henocque
BIRTHDAY
1997
Springer
14 years 2 months ago
Syntax vs. Semantics on Finite Structures
Abstract. Logic preservation theorems often have the form of a syntax/semantics correspondence. For example, the Los-Tarski theorem asserts that a rst-order sentence is preserved b...
Natasha Alechina, Yuri Gurevich