Sciweavers

100 search results - page 15 / 20
» A Schemata Calculus for Propositional Logic
Sort
View
81
Voted
JAL
2008
83views more  JAL 2008»
14 years 10 months ago
Objective Bayesian probabilistic logic
This paper develops connections between objective Bayesian epistemology--which holds that the strengths of an agent's beliefs should be representable by probabilities, should...
Jon Williamson
LFCS
2007
Springer
15 years 4 months ago
Cut Elimination in Deduction Modulo by Abstract Completion
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
Guillaume Burel, Claude Kirchner
103
Voted
LFCS
2009
Springer
15 years 4 months ago
Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination
Canonical propositional Gentzen-type calculi are a natural class of systems which in addition to the standard axioms and structural rules have only logical rules where exactly one ...
Arnon Avron, Anna Zamansky
LOGCOM
1998
178views more  LOGCOM 1998»
14 years 10 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh
93
Voted
FLAIRS
2007
15 years 17 days ago
Handling Qualitative Preferences Using Normal Form Functions
Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called Qualitative Choice Logic (QCL), was presented...
Salem Benferhat, Daniel Le Berre, Karima Sedki