1020 search results - page 9 / 204 » Tight Semantics for Logic Programs |
ICALP
1992
Springer
13 years 11 months ago
1992
Springer
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this...
RULEML
2004
Springer
14 years 26 days ago
2004
Springer
FUIN
2008
13 years 7 months ago
2008
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...