Sciweavers

2414 search results - page 91 / 483
» Computing Normal Subgroups
Sort
View
IJCAI
2001
13 years 10 months ago
Computational Complexity of Planning with Temporal Goals
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...
Chitta Baral, Vladik Kreinovich, Raul Trejo
EACL
1989
ACL Anthology
13 years 10 months ago
Computational Semantics Of Mass Terms
Although the formalisms normally used for describing the semantics of natural languages are far from computationally tractable, it is possible to isolate particular semantic pheno...
Jan Tore Lønning
CIIA
2009
13 years 10 months ago
Practical Use of an Audiometer Based on a Computer Software for Hearing Loss Screening
The project aimed at developing a software audiometer for hearing loss screening. The proposed software is definitely based on the internal peripherals of the computer without any ...
Ykhlef Fayçal, W. Benzaba, L. Bendaouia, A....
SYNTHESE
2008
88views more  SYNTHESE 2008»
13 years 9 months ago
Interpolation in computing science: the semantics of modularization
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...
Gerard R. Renardel de Lavalette
LFCS
2009
Springer
14 years 3 months ago
The Logic of Proofs as a Foundation for Certifying Mobile Computation
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...
Eduardo Bonelli, Federico Feller