Sciweavers

4266 search results - page 54 / 854
» A Framework for Defining Logics
Sort
View
AICCSA
2005
IEEE
87views Hardware» more  AICCSA 2005»
15 years 3 months ago
A XML format secure protocol - OpenSST
OpenSST (Open Simple Secure Transaction) is a free software project and aims to create an efficient, open and secure alternative to the secure proprietary transaction protocol. Op...
Xinhua Zhang, Chunyan Jiang, Wanjun Huang, Christo...
ALT
2010
Springer
14 years 11 months ago
Towards General Algorithms for Grammatical Inference
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of ...
Alexander Clark
AMAI
2006
Springer
14 years 9 months ago
Possibilistic uncertainty handling for answer set programming
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
CADE
2008
Springer
15 years 10 months ago
Specification Predicates with Explicit Dependency Information
Specifications of programs use auxiliary symbols to encapsulate concepts for a variety of reasons: readability, reusability, structuring and, in particular, for writing recursive d...
Richard Bubel, Reiner Hähnle, Peter H. Schmit...
ICFP
2003
ACM
15 years 9 months ago
An extension of HM(X) with bounded existential and universal data-types
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
Vincent Simonet