Sciweavers

7456 search results - page 1343 / 1492
» Parallelism in Logic Programming
Sort
View
IGPL
2010
117views more  IGPL 2010»
15 years 20 days ago
Executable specification of open multi-agent systems
Multi-agent systems where the agents are developed by parties with competing interests, and where there is no access to an agent's internal state, are often classified as `ope...
Alexander Artikis, Marek J. Sergot
112
Voted
COLING
2010
14 years 10 months ago
Knowing What to Believe (when you already know something)
Although much work in NLP has focused on simply determining what a document means, we also must know whether or not to believe it. Fact-finding algorithms attempt to identify the ...
Jeff Pasternack, Dan Roth
JDCTA
2010
150views more  JDCTA 2010»
14 years 10 months ago
Proof as Composition: An approach for the Large-granularity Web Services Composition
The large-granularity Web services are a new form of Web services. In contrast to the traditional Web services, they often have more interfaces, encapsulate more complex business ...
Yuyu Yin, Ying Li, Jianwei Yin, ShuiGuang Deng
177
Voted
JSC
2010
100views more  JSC 2010»
14 years 10 months ago
An invariant-based approach to the verification of asynchronous parameterized networks
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
Igor V. Konnov, Vladimir A. Zakharov
CORR
2011
Springer
165views Education» more  CORR 2011»
14 years 7 months ago
Tight Upper Bounds for Streett and Parity Complementation
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...
Yang Cai, Ting Zhang
« Prev « First page 1343 / 1492 Last » Next »