Sciweavers

1418 search results - page 85 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
CIE
2008
Springer
15 years 6 months ago
Succinct NP Proofs from an Extractability Assumption
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
Giovanni Di Crescenzo, Helger Lipmaa
LREC
2010
191views Education» more  LREC 2010»
15 years 5 months ago
Spatial Role Labeling: Task Definition and Annotation Scheme
One of the essential functions of natural language is to talk about spatial relationships between objects. Linguistic constructs can express highly complex, relational structures ...
Parisa KordJamshidi, Martijn van Otterlo, Marie-Fr...
AAAI
2000
15 years 5 months ago
A Consistency-Based Model for Belief Change: Preliminary Report
We present a general, consistency-based framework for belief change. Informally, in revising K by , we begin with and incorporate as much of K as consistently possible. Formally, ...
James P. Delgrande, Torsten Schaub
CSCWD
2001
Springer
15 years 8 months ago
Modeling Workflow within Distributed Systems
Workflow management techniques are aiming at supporting business process across organization boundaries. Current techniques are lacking of the formalism tools to model and analyze...
Yuhong Yan, Alex Bejan
ECOOPW
2008
Springer
15 years 5 months ago
Equation-Based Object-Oriented Languages and Tools
EOOLT'2007 was the first edition of the ECOOP-EOOLT workshop. The workshop is intended to bring researchers associated with different equation-based object-oriented (EOO) mode...
Peter Fritzson, David Broman, François Cell...