You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This thesis studies the combination of two well known formal systems for knowledge representation: probabilistic logic and justification logic. Our aim is to design a formal framework that allows the analysis of epistemic situations with incomplete information. In order to achieve this we introduce two probabilistic justification logics, which are defined by adding probability operators to the minimal justification logic J. We prove soundness and completeness theorems for our logics and establish decidability procedures. Both our logics rely on an infinitary rule so that strong completeness can be achieved. One of the most interesting mathematical results for our logics is the fact that adding only one iteration of the probability operator to the justification logic J does not increase the computational complexity of the logic.
This book constitutes the refereed proceedings of the 5th International Conference on Logic and Argumentation, CLAR 2023, held in Hangzhou, China, during September 10-12, 2023. The 11 full papers, one short paper and one invited paper presented in this book were carefully reviewed and selected from 20 submissions. The papers focus on topics such as: logic and automated deduction; abstract and structured argumentation; dialogues, games and practical reasoning; and quantitative argumentation.
Proof theory has long been established as a basic discipline of mathematical logic. It has recently become increasingly relevant to computer science. The - ductive apparatus provided by proof theory has proved useful for metatheoretical purposes as well as for practical applications. Thus it seemed to us most natural to bring researchers together to assess both the role proof theory already plays in computer science and the role it might play in the future. The form of a Dagstuhl seminar is most suitable for purposes like this, as Schloß Dagstuhl provides a very convenient and stimulating environment to - scuss new ideas and developments. To accompany the conference with a proc- dings volume appeared to us equally appropriate. Such a volume not only ?xes basic results of the subject and makes them available to a broader audience, but also signals to the scienti?c community that Proof Theory in Computer Science (PTCS) is a major research branch within the wider ?eld of logic in computer science.
Inauguraldissertation an der Philosophisch-naturwissenschaftlichen Fakultät der Universität Bern.
This book constitutes the refereed proceedings of the Third International Conference on Logic and Argumentation, CLAR 2020, held in Hangzhou, China, in April 2020. The 14 full and 7 short papers presented were carefully reviewed and selected from 31 submissions. The papers cover the focus of the CLAR series, including formal models of argumentation, logics for decision making and uncertainreasoning, formal models of evidence, con rmation, and justi cation, logics forgroup cognition and social network, reasoning about norms, formal representationsof natural language and legal texts, as well as applications of argumentationon climate engineering.
DEXA 2005, the 16th International Conference on Database and Expert Systems Applications, was held at the Copenhagen Business School, Copenhagen, Denmark, from August 22 to 26, 2005. The success of the DEXA series has partly been due to the way in which it has kept abreast of recent developments by spawning specialized workshops and conferences each with its own proceedings. In 2005 the DEXA programme was co-located with the 7th International Conference on Data Warehousing and Knowledge Discovery [DaWaK 2005], the 6th International Conference on Electronic Commerce and Web Technologies [EC-Web 2005], the 4th International Conference on Electronic Government [EGOV 2005], the 2nd International...
This book contains thoroughly refereed and revised papers from the 7th International Andrei Ershov Memorial Conference on Perspectives of System Informatics, PSI 2009, held in Akademgorodok, Novosibirsk, Russia, in June 2009. The 26 revised full papers and 4 revised short papers presented were carefully reviewed and selected from 67 submissions. The volume also contains 5 invited papers covering a range of hot topics in system informatics. The papers address all current aspects of theoretical computer science, programming methodology, and new information technologies, which are among the most important contributions of system informatics.
This book constitutes the refereed proceedings of the Third VLDB 2006 International Workshop on Secure Data Management, SDM 2006, held in Seoul, Korea in September 2006 in conjunction with VLDB 2006. The book presents 13 revised full papers, organized in topical sections on privacy protection, privacy preserving data management, access control, and database security.
In this two-volume compilation of articles, leading researchers reevaluate the success of Hilbert's axiomatic method, which not only laid the foundations for our understanding of modern mathematics, but also found applications in physics, computer science and elsewhere. The title takes its name from David Hilbert's seminal talk Axiomatisches Denken, given at a meeting of the Swiss Mathematical Society in Zurich in 1917. This marked the beginning of Hilbert's return to his foundational studies, which ultimately resulted in the establishment of proof theory as a new branch in the emerging field of mathematical logic. Hilbert also used the opportunity to bring Paul Bernays back to Göttingen as his main collaborator in foundational studies in the years to come. The contributions are addressed to mathematical and philosophical logicians, but also to philosophers of science as well as physicists and computer scientists with an interest in foundations.