Sciweavers

271 search results - page 16 / 55
» A comparison between two logical formalisms for rewriting
Sort
View
IANDC
2011
127views more  IANDC 2011»
13 years 2 months ago
On the consistency, expressiveness, and precision of partial modeling formalisms
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
Ou Wei, Arie Gurfinkel, Marsha Chechik
ICFEM
2004
Springer
14 years 1 months ago
A Formal Monitoring-Based Framework for Software Development and Analysis
A formal framework for software development and analysis is presented, which aims at reducing the gap between formal specification and implementation by integrating the two and al...
Feng Chen, Marcelo d'Amorim, Grigore Rosu
NIPS
2007
13 years 9 months ago
Evaluating Search Engines by Modeling the Relationship Between Relevance and Clicks
We propose a model that leverages the millions of clicks received by web search engines to predict document relevance. This allows the comparison of ranking functions when clicks ...
Ben Carterette, Rosie Jones
ECAI
2004
Springer
14 years 1 months ago
New Insights on the Intuitionistic Interpretation of Default Logic
In this work we further investigate the relation, first found by Truszczy´nski, between modal logic S4F and Default Logic (DL), analyzing some interesting properties and showing ...
Pedro Cabalar, David Lorenzo
POPL
2004
ACM
14 years 8 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford