Sciweavers

2496 search results - page 137 / 500
» On covering by translates of a set
Sort
View
TPHOL
2007
IEEE
16 years 23 days ago
Mizar's Soft Type System
In Mizar, unlike in most other proof assistants, the types are not part of the foundations of the system. Mizar is based on untyped set theory, which means that in Mizar expression...
Freek Wiedijk
ERCIMDL
2004
Springer
116views Education» more  ERCIMDL 2004»
15 years 12 months ago
Towards a Policy Language for Humans and Computers
Abstract. A policy is a statement that an action is permitted or forbidden if certain conditions hold. We introduce a language for reasoning about policies called Rosetta. What mak...
Vicky Weissman, Carl Lagoze
LPNMR
2001
Springer
15 years 11 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
COSIT
2009
Springer
125views GIS» more  COSIT 2009»
15 years 10 months ago
Merging Qualitative Constraint Networks Defined on Different Qualitative Formalisms
Abstract. This paper addresses the problem of merging qualitative constraint networks (QCNs) defined on different qualitative formalisms. Our model is restricted to formalisms wher...
Jean-François Condotta, Souhila Kaci, Pierr...
ACL
2006
15 years 8 months ago
Factoring Synchronous Grammars by Sorting
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...
Daniel Gildea, Giorgio Satta, Hao Zhang