Sciweavers

1705 search results - page 129 / 341
» Representing Constraints with Automata
Sort
View
JLP
2010
125views more  JLP 2010»
15 years 2 months ago
Algebraic simulations
Abstract. ComputationalsystemsareoftenrepresentedbymeansofKripkestructures, and related using simulations. We propose rewriting logic as a flexible and executable framework in whi...
José Meseguer, Miguel Palomino, Narciso Mar...
TAICPART
2010
IEEE
166views Education» more  TAICPART 2010»
15 years 2 months ago
Linguistic Security Testing for Text Communication Protocols
We introduce a new Syntax-based Security Testing (SST) framework that uses a protocol specification to perform security testing on text-based communication protocols. A protocol sp...
Ben W. Y. Kam, Thomas R. Dean
ACL
2010
15 years 2 months ago
Global Learning of Focused Entailment Graphs
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
Jonathan Berant, Ido Dagan, Jacob Goldberger
DLOG
2010
15 years 2 months ago
Guiding Reification in OWL through Aggregation
We put forward a methodological approach aimed at guiding ontology modellers in choosing which relations to reify. Our proposal is based on the notion of aggregation as used in con...
Paula Severi, José Luiz Fiadeiro, David Eks...
IJCGA
2010
78views more  IJCGA 2010»
15 years 1 months ago
Operations Preserving Global Rigidity of Generic Direction-Length Frameworks
A two-dimensional direction-length framework is a pair (G, p), where G = (V ; D, L) is a graph whose edges are labeled as `direction' or `length' edges, and a map p from...
Bill Jackson, Tibor Jordán