Sciweavers

423 search results - page 23 / 85
» On Term Rewriting Systems Having a Rational Derivation
Sort
View
RR
2010
Springer
14 years 8 months ago
Query-Based Access Control for Ontologies
Role-based access control is a standard mechanism in information systems. Based on the role a user has, certain information is kept from the user even if requested. For ontologies ...
Martin Knechtel, Heiner Stuckenschmidt
ACOM
2004
Springer
15 years 3 months ago
Formulating Agent Communication Semantics and Pragmatics as Behavioral Expectations
Abstract. Although several approaches to the semantics of agent communication have been proposed, none of them is really suitable for dealing with agent autonomy, which is a decisi...
Matthias Nickles, Michael Rovatsos, Gerhard Wei&sz...
76
Voted
WFLP
2000
Springer
82views Algorithms» more  WFLP 2000»
15 years 1 months ago
Strong and NV-sequentiality of constructor systems
Constructor Systems (CSs) are an important subclass of Term Rewriting Systems (TRSs) which can be used stract model of some programming languages. While normalizing strategies are...
Salvador Lucas
LACL
2005
Springer
15 years 3 months ago
A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
Hans-Martin Gärtner, Jens Michaelis
ESSLLI
2009
Springer
14 years 7 months ago
POP* and Semantic Labeling Using SAT
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
Martin Avanzini