Sciweavers

605 search results - page 43 / 121
» Normalizers and Split Extensions
Sort
View
AAAI
1994
15 years 10 days ago
Soundness and Completeness of a Logic Programming Approach to Default Logic
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
Grigoris Antoniou, Elmar Langetepe
CN
2008
118views more  CN 2008»
14 years 11 months ago
Modeling and computing throughput capacity of wireless multihop networks
Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (e.g., pr...
Patrick Stuedi, Gustavo Alonso
IANDC
2008
86views more  IANDC 2008»
14 years 11 months ago
Unambiguous Boolean grammars
Abstract. Boolean grammars are an extension of context-free grammars, in which all propositional connectives are allowed. In this paper, the notion of ambiguity in Boolean grammars...
Alexander Okhotin
99
Voted
CORR
2006
Springer
110views Education» more  CORR 2006»
14 years 11 months ago
Definitions by Rewriting in the Calculus of Constructions
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...
Frédéric Blanqui
DCC
2002
IEEE
15 years 10 months ago
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes
This contribution is concerned with a generalization of Itoh and Tsujii's algorithm for inversion in extension fields GF(qm ). Unlike the original algorithm, the method introd...
Jorge Guajardo, Christof Paar