Sciweavers

1175 search results - page 109 / 235
» Abstract computability and algebraic specification
Sort
View
EXPERT
2007
98views more  EXPERT 2007»
13 years 9 months ago
Adopting Software Engineering Trends in AI
three levels of abstraction in system modeling. Computation Independent Model (CIM) corresponds to the system's domain model and is similar to the domain ontology. It does not...
Dragan Djuric, Vladan Devedzic, Dragan Gasevic
FC
2010
Springer
169views Cryptology» more  FC 2010»
14 years 10 days ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea
CP
2010
Springer
13 years 7 months ago
The Lattice Structure of Sets of Surjective Hyper-Operations
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
Barnaby Martin
COGSCI
2004
82views more  COGSCI 2004»
13 years 9 months ago
Restricting grammatical complexity
of natural language syntax often characterize grammatical knowledge as a form of abstract computation. This paper argues that such a characterization is correct, and that fundamen...
Robert Frank
ROOM
2000
13 years 10 months ago
Object-Oriented Refinement and Proof using Behaviour Functions
This paper proposes a new calculus for expressing the behaviour of object-oriented systems. The semantics of the calculus is given in terms of operators from computational categor...
Tony Clark