90 search results - page 16 / 18 » Narrowing and Rewriting Logic: from Foundations to Applicati... |
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
COMPSAC
2010
IEEE
14 years 7 months ago
2010
IEEE
The advent of emerging technologies such as Web services, service-oriented architecture, and cloud computing has enabled us to perform business services more efficiently and effect...
LPNMR
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
PASTE
2010
ACM
14 years 11 months ago
2010
ACM
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
111
click to vote
ENTCS
2006
14 years 9 months ago
2006
Conventional approaches to the modeling of autonomous agents and agent communication rely heavily on the ascription of mental properties like beliefs and intentions to the individ...