Sciweavers

884 search results - page 99 / 177
» A Proof Theory for DL-Lite
Sort
View
CORR
2010
Springer
194views Education» more  CORR 2010»
14 years 9 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
AML
2011
204views Mathematics» more  AML 2011»
14 years 7 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek
ICFP
2008
ACM
15 years 11 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
WWW
2004
ACM
16 years 16 days ago
CTR-S: a logic for specifying contracts in semantic web services
A requirements analysis in the emerging field of Semantic Web Services (SWS) (see http://daml.org/services/swsl/requirements/) has identified four major areas of research: intelli...
Hasan Davulcu, Michael Kifer, I. V. Ramakrishnan
IFM
2007
Springer
15 years 6 months ago
Qualitative Probabilistic Modelling in Event-B
Abstract. Event-B is a notation and method for discrete systems modelling by refinement. We introduce a small but very useful construction: qualitative probabilistic choice. It ex...
Stefan Hallerstede, Thai Son Hoang