1,009 research outputs found
Iterated Belief Change and the Levi Identity
No full textMost works on iterated belief change have focussed on iterated belief revision, namely, on how to compute (K star x) star y. However, historically, belief revision has been defined in terms of belief expansion and belief contraction that have been viewed as primary operations. Accordingly, what we should be looking at are constructions like: (K+x)+y, (K-x)+y, (K-x)+y and (K-x)-y. The first two constructions are relatively innocuous. The last two are, however, more problematic. We look at these sequential operations. In the process, we use the Levi Identity as the guiding principle behind state changes (as opposed to belief set changes)
OTOH
No full textContains the essay “Unsettled Feelings". Funded by SSHRC Institutional Explore Grant. Design by Chloe Brumwell & Randy Lee Cutler.Unsettle
Smart Buildings and Smart Grids (Dagstuhl Seminar 15091)
No full textThis report provides an overview of the program, discussions, and outcomes of Dagstuhl Seminar 15091 "Smart Buildings and Smart Grids", which took place from 22-27 February 2015 at Schloss Dagstuhl - Leibniz Center for Informatics. The main goal of the seminar was to provide a forum for leading Energy Informatics (EI) researchers to discuss their recent research on Smart Buildings and Smart Grids, to further elaborate EI research agenda and methods, and to kick-start new research projects with industry. The report contains abstracts of talks that were held by the participants and the outcomes of several discussion sessions on the focal topics of the seminar (e.g., information technology driven developments in building and power system management, as well as cross-cutting topics, such as computer networks, data management, and system design
Coat Cooke & Joe Poole | Coat Cooke & Rainer Wiens: Reviews
No full textCoat Cooke album reviews by Randy Raine-Reusch. Coat Cooke (sax); Joe Poole (drums); Rainer Wiens (guitar)
On semantic resolution with lemmaizing and contraction
No full textReducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies prevent redundant search by using lemmaizing and caching, whereas contraction-based strategies prevent redundant search by using contraction rules, such as subsumption. In this work we show that lemmaizing and contraction can coexist in the framework of semantic resolution. On the lemmaizing side, we define two meta-level inference rules for lemmaizing in semantic resolution, one for unit and one for non-unit lemmas, and we prove their soundness. Rules for lemmaizing are meta-rules because they use global knowledge about the derivation, e.g. ancestry relations, in order to derive lemmas. On the contraction side, we give contraction rules for semantic strategies, and we define a purity deletion rule for first-order clauses that preserves completeness. While lemmaizing generalizes success caching of model elimination, purity deletion echoes failure caching. Thus, our approach integrates features of backward and forward reasoning
Interview with Randy Stoecker, author, Liberating Service Learning and the Rest of Higher Education Civic Engagement
No full textIt’s common for colleges in the U.S. to have service learning programs of one kind or another. These are sometimes criticized as being liberal or even radical endeavors — especially if “social justice” language is employed. But what if these are, in fact, conservative programs at their heart, ones that, in the context of the corporatized university, are furthering the neoliberal project and inhibiting the development of better social welfare policies? Listen to our interview with Randy Stoecker as he discusses his book, Liberating Service Learning and the Rest of Higher Education Civic Engagement (Temple University Press, 2016), for a first-hand critique as well as some thoughts on how we might all better serve our students — and the communities they would engage with
Using Ontological Knowledge and Large Language Model Vector Similarities to Extract Relevant Concepts in VAT-Related Legal Judgments
No full textIn this paper, we present OntoVAT, a multilingual ontology designed for extracting knowledge in legal judgments related to VAT (Value-Added Tax). This is, to our knowledge, the first extensive ontol- ogy in the VAT domain. OntoVAT aims to encapsulate critical concepts in the European VAT area and offers a scalable and reusable knowledge structure to support the automatic identification of VAT-specific con- cepts in legal texts. Additionally, OntoVAT supports various Artificial Intelligence and Law (AI&Law) tasks, such as extracting legal knowledge, identifying keywords, modeling topics, and extracting semantic relations. Developed using OWL with SKOS lexicalization, OntoVAT’s initial ver- sion includes ontological patterns and relations. It is available in three languages, marking a collaborative effort between computer scientists and subject matter experts. In this work, we also present an application scenario where the knowledge encoded within OntoVAT is leveraged in combination with several recent Large Language Models (LLMs). For this application, for which we used the most powerful open source LLMs avail- able today (both generative and non-generative, including legal LLMs), we show the system’s design and some preliminary results
A 21/16-Approximation for the Minimum 3-Path Partition Problem
No full textThe minimum k-path partition (Min-k-PP for short) problem targets to partition an input graph into the smallest number of paths, each of which has order at most k. We focus on the special case when k=3. Existing literature mainly concentrates on the exact algorithms for special graphs, such as trees. Because of the challenge of NP-hardness on general graphs, the approximability of the Min-3-PP problem attracts researchers' attention. The first approximation algorithm dates back about 10 years and achieves an approximation ratio of 3/2, which was recently improved to 13/9 and further to 4/3. We investigate the 3/2-approximation algorithm for the Min-3-PP problem and discover several interesting structural properties. Instead of studying the unweighted Min-3-PP problem directly, we design a novel weight schema for l-paths, l in {1, 2, 3}, and investigate the weighted version. A greedy local search algorithm is proposed to generate a heavy path partition. We show the achieved path partition has the least 1-paths, which is also the key ingredient for the algorithms with ratios 13/9 and 4/3. When switching back to the unweighted objective function, we prove the approximation ratio 21/16 via amortized analysis
[Photograph 2012.201.B0223.0045]
No full textPhotograph used for a story in the Daily Oklahoman newspaper. Caption: "Dena Taylor , Randy Buttram, Dr. Kay Goebel and Bill Johnstone, from left, look into the food situation.
Reflections 1979
No full textThe 1979 issue of Reflections is edited by Randy Waters with Michele Barale and Joyce Compton Brown serving as faculty advisers. Cover art and photography is by Les Brown. Author biographies are included on a contributors page at the conclusion of the issue. Award winners of the student literary context include: Randy Waters, Debbie Drayer, and Susan Sheilds.https://digitalcommons.gardner-webb.edu/reflections/1005/thumbnail.jp
- …
