Sciweavers

190 search results - page 23 / 38
» An application of automated reasoning in natural language qu...
Sort
View
ICLP
2004
Springer
14 years 29 days ago
On Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
LACL
2005
Springer
14 years 1 months ago
Learnable Classes of General Combinatory Grammars
Abstract. Kanazawa has shown that k-valued classical categorial grammars have the property of finite elasticity [1], which is a sufficient condition for learnability. He has also ...
Erwan Moreau
ICCBR
2010
Springer
13 years 11 months ago
Text Adaptation Using Formal Concept Analysis
This paper addresses the issue of adapting cases represented by plain text with the help of formal concept analysis and natural language processing technologies. The actual cases r...
Valmi Dufour-Lussier, Jean Lieber, Emmanuel Nauer,...
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 1 months ago
Apply Model Checking to Security Analysis in Trust Management
Trust management is a form of access control that uses delegation to achieve scalability beyond a single organization or federation. However, delegation can be difficult to contr...
Mark Reith, Jianwei Niu, William H. Winsborough
PLILP
1995
Springer
13 years 11 months ago
A Complete Narrowing Calculus for Higher-Order Functional Logic Programming
Abstract. Using higher-order functions is standard practice in functional programming, but most functional logic programming languages that have been described in the literature la...
Koichi Nakahara, Aart Middeldorp, Tetsuo Ida