Sciweavers

488 search results - page 22 / 98
» Weighted Logics for Traces
Sort
View
EMNLP
2007
13 years 8 months ago
Online Learning of Relaxed CCG Grammars for Parsing to Logical Form
We consider the problem of learning to parse sentences to lambda-calculus representations of their underlying semantics and present an algorithm that learns a weighted combinatory...
Luke S. Zettlemoyer, Michael Collins
FCT
2005
Springer
14 years 28 days ago
On the Expressiveness of Asynchronous Cellular Automata
We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the ...
Benedikt Bollig
POPL
2003
ACM
14 years 7 months ago
From symptom to cause: localizing errors in counterexample traces
There is significant room for improving users' experiences with model checking tools. An error trace produced by a model checker can be lengthy and is indicative of a symptom...
Thomas Ball, Mayur Naik, Sriram K. Rajamani
VLDB
1987
ACM
72views Database» more  VLDB 1987»
13 years 11 months ago
Providing Time-Related Constraints for Conventional Database Systems
A model for a historical database is described which is based upon time-stamped tuples as the unit of storage. The model includes both physical and logical time-stamps. The techni...
T. Abbod, K. Brown, H. Noble
FAC
2008
114views more  FAC 2008»
13 years 7 months ago
Specification of communicating processes: temporal logic versus refusals-based refinement
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
Gavin Lowe