Sciweavers

78 search results - page 9 / 16
» A Logic for Default Reasoning About Probabilities
Sort
View
JELIA
2004
Springer
14 years 26 days ago
Practical Reasoning for Uncertain Agents
Logical formalisation of agent behaviour is desirable, not only in order to provide a clear semantics of agent-based systems, but also to provide the foundation for sophisticated r...
Nivea de Carvalho Ferreira, Michael Fisher, Wiebe ...
JAR
2010
122views more  JAR 2010»
13 years 2 months ago
Partial and Nested Recursive Function Definitions in Higher-order Logic
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...
Alexander Krauss
IFL
2005
Springer
116views Formal Methods» more  IFL 2005»
14 years 1 months ago
Proof Tool Support for Explicit Strictness
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Marko C. J. D. van Eekelen, Maarten de Mol
POPL
2012
ACM
12 years 3 months ago
A type theory for probability density functions
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
Sooraj Bhat, Ashish Agarwal, Richard W. Vuduc, Ale...
KI
2008
Springer
13 years 7 months ago
Shallow Models for Non-iterative Modal Logics
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Lutz Schröder, Dirk Pattinson