Sciweavers

2920 search results - page 279 / 584
» Finite information logic
Sort
View
AAAI
2007
15 years 9 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
ATAL
2008
Springer
15 years 8 months ago
Verifying Social Expectations by Model Checking Truncated Paths
One approach to moderating the expected behaviour of agents in open societies is the use of explicit languages for defining norms, conditional commitments and/or social expectation...
Stephen Cranefield, Michael Winikoff
IJIT
2004
15 years 8 months ago
Rule-Based Message Passing for Collaborative Application in Distributed Environments
In this paper, we describe a rule-based message passing method to support developing collaborative applications, in which multiple users share resources in distributed environments...
Wataru Yamazaki, Hironori Hiraishi, Fumio Mizoguch...
ENTCS
2007
97views more  ENTCS 2007»
15 years 6 months ago
A Head-to-Head Comparison of de Bruijn Indices and Names
Often debates about pros and cons of various techniques for formalising lambda-calculi rely on subjective arguments, such as de Bruijn indices are hard to read for humans or nomin...
Stefan Berghofer, Christian Urban
LPAR
2010
Springer
15 years 5 months ago
On Strong Normalization of the Calculus of Constructions with Type-Based Termination
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
Benjamin Grégoire, Jorge Luis Sacchini