1445 search results - page 38 / 289 » Uniformly Hard Languages |
FMSD
2007
13 years 7 months ago
2007
In the classical framework of formal languages, a refinement n is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studie...
JAIR
2007
13 years 7 months ago
2007
This paper is concerned with a class of algorithms that perform exhaustive search on propositional knowledge bases. We show that each of these algorithms defines and generates a ...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
EDOC
2007
IEEE
14 years 2 months ago
2007
IEEE
A business process usually includes multiple business partners that use systems with their business logics represented in different rule (or policy) languages. The integration of ...
ICMCS
1999
IEEE
14 years 1 days ago
1999
IEEE
The START system responds to natural language queries with answers in text, pictures, and other media. START's sentence-level natural language parsing relies on a number of m...