Sciweavers

36 search results - page 6 / 8
» Pedagogical Natural Deduction Systems: the Propositional Cas...
Sort
View
EUSFLAT
2007
13 years 7 months ago
Using Generalized Constraints and Protoforms to Deal with Adverbs
Computation with information described in natural language (NL) has intrinsic importance because much of human knowledge is described using these languages. Soft Computing approac...
Andrés Soto, José Angel Olivas, Manu...
AAAI
2000
13 years 7 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski
SAT
2007
Springer
118views Hardware» more  SAT 2007»
13 years 11 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
COLING
2002
13 years 5 months ago
Towards a Noise-Tolerant, Representation-Independent Mechanism for Argument Interpretation
We describe a mechanism for the interpretation of arguments, which can cope with noisy conditions in terms of wording, beliefs and argument structure. This is achieved through the...
Ingrid Zukerman, Sarah George
PODC
1990
ACM
13 years 9 months ago
Half-Order Modal Logic: How to Prove Real-Time Properties
Abstract. We introduce a novel extension of propositional modal logic that is interpreted over Kripke structures in which a value is associated with every possible world. These val...
Thomas A. Henzinger