1404 search results - page 43 / 281 » Complexity of admissible rules |
PCI
2005
Springer
14 years 3 months ago
2005
Springer
Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is useful for many applications in the Semantic W...
RR
2007
Springer
14 years 4 months ago
2007
Springer
This paper presents an extension to the Semantic Web Rule Language and a methodology to enable advanced mathematical support in SWRL rules. This solution separates mathematical and...
AMAI
2004
Springer
14 years 3 months ago
2004
Springer
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in s...
ACL
1998
13 years 11 months ago
1998
This paper demonstrates that generating arguments in natural language requires at an abstract level, and that the ate abstraction cannot be captured by approaches based solely upo...
ATAL
2010
Springer
13 years 11 months ago
2010
Springer
A voting rule is an algorithm for determining the winner in an election, and there are several approaches that have been used to justify the proposed rules. One justification is t...