Sciweavers

460 search results - page 68 / 92
» Operational Semantics of Constraint Logic Programs with Coro...
Sort
View
POPL
2010
ACM
14 years 6 months ago
Counterexample-Guided Focus
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Andreas Podelski, Thomas Wies
ICML
2004
IEEE
14 years 9 months ago
Bellman goes relational
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
Kristian Kersting, Martijn Van Otterlo, Luc De Rae...
SCP
1998
163views more  SCP 1998»
13 years 8 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
HASKELL
2006
ACM
14 years 2 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
CIA
2004
Springer
14 years 2 months ago
Reasoning About Communication - A Practical Approach Based on Empirical Semantics
Given a specification of communication rules in a multiagent system (in the form of protocols, ACL semantics, etc.), the question of how to design appropriate agents that can oper...
Felix A. Fischer, Michael Rovatsos