3333 search results - page 48 / 667 » Abstract Proof Search |
114
click to vote
CAV
1993
Springer
15 years 6 months ago
1993
Springer
Abstract. This paper presents a scalable approach to reasoning formally about distributed algorithms. It uses results about I O automata to extract a set of proof obligations for s...
130
click to vote
CNL
2009
15 years 3 months ago
2009
Abstract. This paper discusses the semi-formal language of mathematics and presents the Naproche CNL, a controlled natural language for mathematical authoring. Proof Representation...
123
click to vote
JAMDS
2002
15 years 2 months ago
2002
Abstract. In this paper we provide a simple proof of the extension theorem for partial orderings due to Suzumura [1983] when the domain of the partial order is finite. The extensio...
104
click to vote
LOGCOM
2010
15 years 28 days ago
2010
Abstract. An approximate Herbrand theorem is established for firstorder infinite-valued Lukasiewicz Logic and used to obtain a proof-theoretic proof of Skolemization. These resul...
122
Voted
SEMWEB
2010
Springer
15 years 11 days ago
2010
Springer
Abstract. Justifications -- that is, minimal entailing subsets of an ontology -- are currently the dominant form of explanation provided by ontology engineering environments, espec...