352 search results - page 49 / 71 » Paraconsistent Declarative Semantics for Extended Logic Prog... |
133
Voted
LPAR
2004
Springer
15 years 8 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...
138
Voted
ASP
2005
Springer
15 years 8 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...
105
Voted
LPNMR
2005
Springer
15 years 8 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
138
Voted
EPIA
2003
Springer
15 years 8 months ago
2003
Springer
The Semantic Web is a “living organism”, which combines autonomously evolving data sources/knowledge repositories. This dynamic character of the Semantic Web requires (declarat...
142
Voted
POPL
2012
ACM
13 years 10 months ago
2012
ACM
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...