Sciweavers

134 search results - page 22 / 27
» Meronymy Extraction Using An Automated Theorem Prover
Sort
View
CSL
2001
Springer
15 years 2 months ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ...
Frédéric Koriche
ICFEM
2007
Springer
15 years 1 months ago
Automating Refinement Checking in Probabilistic System Design
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
Carlos Gonzalia, Annabelle McIver
CLIMA
2004
14 years 11 months ago
Metareasoning for Multi-agent Epistemic Logics
Abstract. We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then ...
Konstantine Arkoudas, Selmer Bringsjord
ICFEM
2004
Springer
15 years 3 months ago
Verifying a File System Implementation
Abstract. We present a correctness proof for a basic file system implementation. This implementation contains key elements of standard Unix file systems such as inodes and fixed...
Konstantine Arkoudas, Karen Zee, Viktor Kuncak, Ma...
TPHOL
2009
IEEE
15 years 4 months ago
Formal Analysis of Optical Waveguides in HOL
Optical systems are becoming increasingly important as they tend to resolve many bottlenecks in the present age communications and electronics. Some common examples include their u...
Osman Hasan, Sanaz Khan Afshar, Sofiène Tah...