Sciweavers

1391 search results - page 149 / 279
» Completeness of Neighbourhood Logic
Sort
View
VLDB
1989
ACM
88views Database» more  VLDB 1989»
14 years 1 months ago
On the design and implementation of information systems from deductive conceptual models
Deductive conceptualmodels(DCMs) aim at providing a complete specification of information systems,expressing only its logic component.It hasbeenshownthatDCMs have some advantagesw...
Antoni Olivé
DLOG
2008
13 years 12 months ago
Decidable Reasoning over Timestamped Conceptual Models
We show that reasoning in the temporal conceptual model ERV T , a fragment of ERV T that only allows timestamping is complete for 2-ExpTime. The membership result is based on an em...
Alessandro Artale, David Toman
AAAI
2000
13 years 11 months ago
Decision-Theoretic, High-Level Agent Programming in the Situation Calculus
We propose a frameworkfor robot programming which allows the seamless integration of explicit agent programming with decision-theoretic planning. Specifically, the DTGolog model a...
Craig Boutilier, Raymond Reiter, Mikhail Soutchans...
TC
2002
13 years 9 months ago
Architectures and VLSI Implementations of the AES-Proposal Rijndael
Two architectures and VLSI implementations of the AES Proposal, Rijndael, are presented in this paper. These alternative architectures are operated both for encryption and decrypti...
Nicolas Sklavos, Odysseas G. Koufopavlou
FUIN
2010
111views more  FUIN 2010»
13 years 7 months ago
Linearity, Non-determinism and Solvability
We study the notion of solvability in the resource calculus, an extension of the -calculus modelling resource consumption. Since this calculus is non-deterministic, two different ...
Michele Pagani, Simona Ronchi Della Rocca