Sciweavers

186 search results - page 20 / 38
» Preference-Based Default Reasoning
Sort
View
LPNMR
2009
Springer
14 years 2 months ago
A Default Approach to Semantics of Logic Programs with Constraint Atoms
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...
Yi-Dong Shen, Jia-Huai You
JELIA
2004
Springer
14 years 27 days ago
Logic Programs with Functions and Default Values
In this work we reconsider the replacement of predicate-like notation by functional terms, using a similar syntax to Functional Logic Programming, but under a completely different...
Pedro Cabalar, David Lorenzo
PODS
2006
ACM
156views Database» more  PODS 2006»
14 years 7 months ago
From statistical knowledge bases to degrees of belief: an overview
An intelligent agent will often be uncertain about various properties of its environment, and when acting in that environment it will frequently need to quantify its uncertainty. ...
Joseph Y. Halpern
JLP
1998
147views more  JLP 1998»
13 years 7 months ago
Automated Reasoning with a Constraint-Based Metainterpreter
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...
Henning Christiansen
AAAI
1990
13 years 8 months ago
The Complexity of Closed World Reasoning and Circumscription
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
Marco Cadoli, Maurizio Lenzerini