Publications

Export 18 results:

Filters: First Letter Of Last Name is W [Clear All Filters]

2010

R. Wehbe, “Annotated Systems for Common Knowledge”. Universität Bern, 2010.

2009

K. Brünnler and L. Straßburger, “Modular Sequent Systems for Modal Logic”, in Tableaux 2009, 2009, vol. 5607.

G. Jäger, “Operations, sets and classes”, in Logic, {M}ethodology and {P}hilosophy of {S}cience - {P}roceedings of the {T}hirteenth {I}nternational {C}ongress, 2009.

G. Jäger, “Operations, sets and classes”, in Logic, {M}ethodology and {P}hilosophy of {S}cience - {P}roceedings of the {T}hirteenth {I}nternational {C}ongress, 2009.

2007

R. Wehbe, “Computing with common knowledge”, in Proceedings of Artificial Intelligence and Soft Computing, 2007, p. 45{–}50.

N. Kottmann and T. Studer, “Improving semantic query answering”, in Proceedings of Database and Expert Systems Applications, 2007, vol. 4653, p. 671{–}679.

R. Wehbe, “Merging rule-based belief databases”, in Proceedings of Artificial Intelligence and Applications, 2007, p. 585{–}589.

2006

R. Wehbe, “A hybrid representation of knowledge and belief”, in Proceedings of Formal Approaches to Multi-Agent Systems, 2006.

R. Wehbe, “Revising non-monotonic rule-based belief databases”, in Proceedings of Belief Revision, Belief Merging and Social Choice, 2006.

2005

G. E. Ostrin and S. S. Wainer, “Elementary Arithmetic”, Annals of Pure and Applied Logic, vol. 133, p. 275{–}292, 2005.

G. Jäger, “Metapredicative and explicit Mahlo: a proof-theoretic perspective”, in Proceedings of Logic Colloquium '00, 2005, vol. 19, p. 272{–}293.

M. Dürig and T. Studer, “Probabilistic ABox reasoning: preliminary results”, in Proceedings of Description Logics '05, 2005, vol. 147, p. 104{–}111.

K. Stoffel and T. Studer, “Provable data privacy”, in Proceedings of 16th International Conference on Database and Expert Systems Applications, 2005, vol. 3588, p. 324{–}332.

M. Wirz, “Wellordering Two Sorts: A Slow-Growing Proof Theory for Variable Separation”. Universität Bern, 2005.

2002

G. E. Ostrin and S. S. Wainer, “Proof theoretic complexity”, in Proof and System Reliability, 2002, vol. 62, p. 369{–}398.

L. Alberucci, “Strictness of the modal $μ$-calculus hierarchy”, in Automata, Logics and infinite Games: A Guide to Current Research, 2002, vol. 2500, p. 185{–}201.

1999

M. Wirz, “Characterizing the Grzegorczyk hierarchy by safe recursion”. Universität Bern, 1999.

M. Wirz, “Charakterisierungen kleiner Komplexitätsklassen mittels geschichteter N-Prädikate”. Universität Bern, 1999.