Sciweavers

472 search results - page 29 / 95
» Limiting Negations in Formulas
Sort
View
JAIR
2008
92views more  JAIR 2008»
13 years 10 months ago
On the Expressiveness of Levesque's Normal Form
Levesque proposed a generalization of a database called a proper knowledge base (KB), which is equivalent to a possibly infinite consistent set of ground literals. In contrast to ...
Yongmei Liu, Gerhard Lakemeyer
ENTCS
2007
80views more  ENTCS 2007»
13 years 10 months ago
Topological Perspective on the Hybrid Proof Rules
We consider the non-orthodox proof rules of hybrid logic from the viewpoint of topological semantics. Topological semantics is more general than Kripke semantics. We show that the...
Balder ten Cate, Tadeusz Litak
AMAI
2004
Springer
13 years 10 months ago
Multi-Agent Systems Specification and Certification: A Situation and State Calculus Approach
We address the topic of specifying multi-agent systems using the situation and state calculus (SSC). SSC has been proposed as an extension of the situation calculus to overcome so...
Paula Gouveia, Jaime Ramos
GRID
2010
Springer
13 years 7 months ago
Parallel SAT Solving on Peer-to-Peer Desktop Grids
Abstract Satciety is a distributed parallel satisfiability (SAT) solver which focuses on tackling the domainspecific problems inherent to one of the most challenging environments f...
Sven Schulz, Wolfgang Blochinger
GECCO
2006
Springer
123views Optimization» more  GECCO 2006»
14 years 1 months ago
Reconsidering the progress rate theory for evolution strategies in finite dimensions
This paper investigates the limits of the predictions based on the classical progress rate theory for Evolution Strategies. We explain on the sphere function why positive progress...
Anne Auger, Nikolaus Hansen