Sciweavers

2540 search results - page 400 / 508
» Abstract Logics as Dialgebras
Sort
View
CORR
2006
Springer
112views Education» more  CORR 2006»
13 years 9 months ago
Satisfying KBO Constraints
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...
Harald Zankl, Aart Middeldorp
JCS
2006
118views more  JCS 2006»
13 years 9 months ago
Language based policy analysis in a SPKI Trust Management System
Abstract-- SPKI/SDSI is a standard for issuing authorization and name certificates. SPKI/SDSI can be used to implement a Trust Management System, where the policy for resource acce...
Arun K. Eamani, A. Prasad Sistla
4OR
2004
43views more  4OR 2004»
13 years 9 months ago
Concordant outranking with multiple criteria of ordinal significance
Abstract In this paper we address the problem of aggregating outranking statements from multiple preference criteria of ordinal significance. The concept of ordinal concordance of ...
Raymond Bisdorff
ACTAC
2002
75views more  ACTAC 2002»
13 years 9 months ago
Framework for Studying Substitution
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
Härmel Nestra
ANOR
2002
67views more  ANOR 2002»
13 years 9 months ago
An Improved Hybrid Model for the Generic Hoist Scheduling Problem
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
Daniel Riera, Neil Yorke-Smith