507 search results - page 62 / 102 » Automating first-order relational logic |
CADE
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. We present KeY-C, a tool for deductive verification of C programs. KeY-C allows to prove partial correctness of C programs relative to pre- and postconditions. It is base...
97
Voted
DLOG
1996
15 years 2 months ago
1996
To ensure the re-use of domain ontologies the usual approach relies on a pivot language, e.g., Kif, intoandfromwhich the domainontologyis translated. This requires several distinc...
132
click to vote
TPHOL
1999
IEEE
15 years 5 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
104
click to vote
CSL
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
198
click to vote
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
PRISM is a probabilistic extension of Prolog. It is a high level language for probabilistic modeling capable of learning statistical parameters from observed data. After reviewing ...