265 search results - page 22 / 53 » Weakly Algebraizable Logics |
130
click to vote
ISICT
2003
15 years 3 months ago
2003
: Formal verification provides a rigid and thorough means of evaluating the correctness of cryptographic protocols so that even subtle defects can be identified. As the application...
163
click to vote
LICS
2012
IEEE
13 years 4 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
100
click to vote
AAAI
2008
15 years 4 months ago
2008
Temporal logics are widely used in specifying goals of agents. We noticed that when directing agents, humans often revise their requirements for the agent, especially as they gath...
142
click to vote
IJIT
2004
15 years 3 months ago
2004
This paper presents a semi-supervised learning algorithm called Iterative-Cross Training (ICT) to solve the Web pages classification problems. We apply Inductive logic programming ...
111
Voted
TABLEAUX
1998
Springer
15 years 6 months ago
1998
Springer
The methodology of fibring is a successful framework for combining logical systems based on combining their semantics. In this paper, we extend the fibring approach to calculi for ...