2501 search results - page 181 / 501 » Logics with Rank Operators |
135
click to vote
TACS
2001
Springer
15 years 9 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...
132
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...
146
click to vote
ICLP
2010
Springer
15 years 8 months ago
2010
Springer
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...
176
click to vote
CONCUR
2006
Springer
15 years 6 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
139
click to vote
DLOG
2003
15 years 6 months ago
2003
In this short position paper, the project of building intelligent business information infrastructure using semantic web, ontology, description logics, and other related knowledge...