Sciweavers

3408 search results - page 163 / 682
» Logic, language, information and computation
Sort
View
JACM
2002
122views more  JACM 2002»
15 years 6 months ago
Cosmological lower bound on the circuit complexity of a small problem in logic
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
Larry J. Stockmeyer, Albert R. Meyer
AMAST
2008
Springer
15 years 8 months ago
Service Specification and Matchmaking Using Description Logic
ed Abstract an extended abstract of [11]. Service-oriented computing is emerging as a new paradigm based on autonomous, platform-independent computational entities, called services...
M. Birna van Riemsdijk, Rolf Hennicker, Martin Wir...
INLG
2010
Springer
15 years 4 months ago
Applying Semantic Frame Theory to Automate Natural Language Template Generation From Ontology Statements
Today there exist a growing number of framenet-like resources offering semantic and syntactic phrase specifications that can be exploited by natural language generation systems. I...
Dana Dannélls
ICTCS
2005
Springer
16 years 1 days ago
A Typed Assembly Language for Non-interference
Abstract. Non-interference is a desirable property of systems in a multilevel security architecture, stating that confidential information is not disclosed in public output. The c...
Ricardo Medel, Adriana B. Compagnoni, Eduardo Bone...
BIRTHDAY
2004
Springer
15 years 12 months ago
Composing Hidden Information Modules over Inclusive Institutions
: This paper studies the composition of modules that can hide information, over a very general class of logical systems called inclusive institutions. Two semantics are given for c...
Joseph A. Goguen, Grigore Rosu