Sciweavers

1679 search results - page 77 / 336
» Strong order equivalence
Sort
View
AAECC
2009
Springer
142views Algorithms» more  AAECC 2009»
14 years 2 months ago
New Commutative Semifields and Their Nuclei
Abstract. Commutative semifields in odd characteristic can be equivalently described by planar functions (also known as PN functions). We describe a method to construct a semifield...
Jürgen Bierbrauer
ARC
2007
Springer
118views Hardware» more  ARC 2007»
14 years 2 months ago
Simulation of the Dynamic Behavior of One-Dimensional Cellular Automata Using Reconfigurable Computing
This paper presents the implementation of an environment for the evolution of one-dimensional cellular automata using a reconfigurable logic device. This configware is aimed at eva...
Wagner Rodrigo Weinert, César Manuel Vargas...
IJCAI
2007
13 years 11 months ago
From Answer Set Logic Programming to Circumscription via Logic of GK
We first provide a mapping from Pearce’s equilibrium logic and Ferraris’s general logic programs to Lin and Shoham’s logic of knowledge and justified assumptions, a nonmon...
Fangzhen Lin, Yi Zhou
JAIR
2006
102views more  JAIR 2006»
13 years 10 months ago
Properties and Applications of Programs with Monotone and Convex Constraints
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of...
Lengning Liu, Miroslaw Truszczynski
FUIN
2006
85views more  FUIN 2006»
13 years 10 months ago
Towards Integrated Verification of Timed Transition Models
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
Mark Lawford, Vera Pantelic, Hong Zhang