5284 search results - page 801 / 1057 » Ontologizing Semantic Relations |
157
Voted
LPNMR
2005
Springer
16 years 3 days 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 ...
167
click to vote
TACS
2001
Springer
15 years 11 months ago
2001
Springer
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
196
click to vote
IFL
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non...
161
click to vote
ILP
2000
Springer
15 years 10 months ago
2000
Springer
First-order probabilistic models are recognized as efficient frameworks to represent several realworld problems: they combine the expressive power of first-order logic, which serv...
163
Voted
KR
2000
Springer
15 years 10 months ago
2000
Springer
Recent experimental results have shown that the strength of resolution, the propositional DPLL procedure, the KSAT procedure for description logics, or related tableau-like implem...