Sciweavers

1321 search results - page 49 / 265
» Subtyping in Logical Form
Sort
View
IJCAI
2007
15 years 1 months ago
Recursive Random Fields
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
Daniel Lowd, Pedro Domingos
KR
2004
Springer
15 years 5 months ago
A Logic-Based Formulation of Active Visual Perception
Building on earlier attempts to characterise robot perception as a form of abduction, this paper presents a logical account of active visual perception in the context of an upper-...
Murray Shanahan, David A. Randell
PLPV
2012
ACM
13 years 7 months ago
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...
Alan Jeffrey
POPL
2010
ACM
15 years 9 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
APAL
2004
78views more  APAL 2004»
14 years 11 months ago
Ternary relations and relevant semantics
Modus ponens provides the central theme. There are laws, of the form A C. A logic (or other theory) L collects such laws. Any datum A (or theory T incorporating such data) provid...
Robert K. Meyer