3738 search results - page 440 / 748 » Parametrized Logic Programming |
146
click to vote
APLAS
2010
ACM
15 years 3 months ago
2010
ACM
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
127
click to vote
SEMWEB
2007
Springer
15 years 9 months ago
2007
Springer
Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. As a solution we will combine fuzzy Description Logics with a possibilistic layer....
177
click to vote
USS
2010
15 years 1 months ago
2010
Web applications are the most common way to make services and data available on the Internet. Unfortunately, with the increase in the number and complexity of these applications, ...
146
click to vote
JACM
2010
15 years 1 months ago
2010
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
142
click to vote
CSL
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...