Sciweavers

254 search results - page 13 / 51
» Answer Sets for Propositional Theories
Sort
View
AMAI
2006
Springer
13 years 7 months ago
Possibilistic uncertainty handling for answer set programming
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
ENGL
2007
144views more  ENGL 2007»
13 years 7 months ago
Constructive Analysis of Intensional Phenomena in Natural Language
Abstract— Chierchia [2, 3, 4], pointed out the inadequacy of Montague’s approach in the analysis of certain natural language constructions, such as nominalization and propositi...
Rogelio Davila, Leonardo Soto, Nahitt H. Padilla
ATAL
2010
Springer
13 years 8 months ago
Using answer set programming to model multi-agent scenarios involving agents' knowledge about other's knowledge
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...
Chitta Baral, Gregory Gelfond, Tran Cao Son, Enric...
LPNMR
1999
Springer
13 years 12 months ago
Representing Transition Systems by Logic Programs
This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action langua...
Vladimir Lifschitz, Hudson Turner
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 6 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel