Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Defeasible reasoning

Related publications (9)

Monotonicity Reasoning in the Age of Neural Foundation Models

Zeming Chen

The recent advance of large language models (LLMs) demonstrates that these large-scale foundation models achieve remarkable capabilities across a wide range of language tasks and domains. The success of the statistical learning approach challenges our unde ...

Springer2023

Reshaping Perception for Autonomous Driving with Semantic Keypoints

Lorenzo Bertoni

The field of artificial intelligence is set to fuel the future of mobility by driving forward the transition from advanced driver-assist systems to fully autonomous vehicles (AV). Yet the current technology, backed by cutting-edge deep learning techniques, ...

EPFL2022

Stoic: Towards Disciplined Capabilities

Martin Odersky, Nada Amin, Sandro Stucki, Fengyun Liu, Paolo Giosuè Giarrusso

Capabilities are widely used in the design of software systems to ensure security. A system of capabilities can become a mess in the presence of objects and functions: objects may leak capabilities and functions may capture capabilities. They make reasonin ...

2020

A Bayesian Model of Individual Differences and Flexibility in Inductive Reasoning for Categorization of Examples

Pierre Dillenbourg, Jennifer Kaitlyn Olsen, Louis Pierre Faucon

Inductive reasoning is an important educational practice but can be difficult for teachers to support in the classroom due to the high level of preparation and classroom time needed to choose the teaching materials that challenge students' current views. I ...

ASSOC COMPUTING MACHINERY2020

Learning Search Strategies from Human Demonstrations

Guillaume Pierre Luc De Chambrier

Decision making and planning with partial state information is a problem faced by all forms of intelligent entities. The formulation of a problem under partial state information leads to an exorbitant set of choices with associated probabilistic outcomes m ...

EPFL2016

Induction for SMT Solvers

Viktor Kuncak, Andrew Joseph Reynolds

Satisfiability modulo theory solvers are increasingly being used to solve quantified formulas over structures such as integers and term algebras. Quantifier instantiation combined with ground decision procedure alone is insufficient to prove many formulas ...

Springer-Verlag2015

Ontology-based approach for context modeling in enterprise applications

Dimitrios Kyritsis, Drazen Nadoveza

Today, enterprise applications provide large amounts of data and finding the right information on time for a given purpose is often a challenge. In these environments, users do not know what information is important, why it is important and finally, how to ...

Elsevier Science Bv2014

Towards Complete Reasoning about Axiomatic Specifications

Viktor Kuncak, Swen Jacobs

To support verification of expressive properties of functional programs, we consider algebraic style specifications that may relate multiple user-defined functions, and compare multiple invocations of a function for different arguments. We present decision ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

Evaluating Cases in Legal Disputes as Rival Theories

Jingshi Li

In this paper we propose to draw a link from the quantitative notion of coherence, previously used to evaluate rival scientific theories, to legal reasoning. We evaluate the stories of the plaintiff and the defendant in a legal case as rival theories by me ...

2010

Related publications (9)