3658 search results - page 235 / 732 » The logic of proofs, semantically |
188
click to vote
LOGCOM
2010
15 years 1 months ago
2010
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
168
click to vote
MSCS
2006
15 years 6 months ago
2006
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...
185
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
The Semantic Web languages RDFS and OWL have been around for some time now. However, the presence of these languages has not brought the breakthrough of the Semantic Web the creat...
162
click to vote
ISMVL
2007
IEEE
16 years 1 months ago
2007
IEEE
Paraconsistent logic is the study of contradictory yet non-trivial theories. One of the best-known approaches to designing useful paraconsistent logics is da Costa’s approach, w...
181
click to vote
LPNMR
2004
Springer
16 years 1 days ago
2004
Springer
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX , where k is a non-negative integer and X is a finite set of ...