351 search results - page 50 / 71 » Classical Logic with Partial Functions |
103
click to vote
ASP
2005
Springer
15 years 3 months ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
LPAR
2004
Springer
15 years 3 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
UAI
2003
14 years 11 months ago
2003
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or setvalued). This is a fundamental pro...
AI
2008
Springer
14 years 9 months ago
2008
Springer
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
93
Voted
CSCLP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...