Image de couverture de livre

Computation and Complexity of Preference Inference Based on Hierarchical Models

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wilson, Nic, George, Anne-Marie, O'Sullivan, Barry
Format:	Preprint
Publié:	2024
Sujets:	Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Towards Fast Algorithms for the Preference Consistency Problem Based on Hierarchical Models
par: George, Anne-Marie, et autres
Publié: (2024)

Efficient Inference and Computation of Optimal Alternatives for Preference Languages Based On Lexicographic Models
par: Wilson, Nic, et autres
Publié: (2024)

On Middle Grounds for Preference Statements
par: George, Anne-Marie, et autres
Publié: (2025)

Meta-Mathematics of Computational Complexity Theory
par: Oliveira, Igor C.
Publié: (2025)

On Randomized Computational Models and Complexity Classes: a Historical Overview
par: Antonelli, Melissa, et autres
Publié: (2024)

Computational Complexity of Standpoint LTL
par: Demri, Stéphane, et autres
Publié: (2024)

Complexity of the Model Checking problem for inquisitive propositional and modal logic
par: Grilletti, Gianluca, et autres
Publié: (2024)

Cyclic Implicit Complexity
par: Curzi, Gianluca, et autres
Publié: (2021)

The Complexity of the Constructive Master Modality
par: Santiago-Fernández, Sofía, et autres
Publié: (2026)

Bridging Computational Notions of Depth
par: Bienvenu, Laurent, et autres
Publié: (2024)

Hyperarithmetical Complexity of Infinitary Action Logic with Multiplexing
par: Pshenitsyn, Tikhon
Publié: (2023)

Modular Assurance of Complex Systems Using Contract-Based Design Principles
par: McGeorge, Dag, et autres
Publié: (2024)

Dynamic Probability Logic: Decidability & Computability
par: Chopoghloo, Somayeh, et autres
Publié: (2024)

Fixed Point Theorems in Computability Theory
par: Terwijn, Sebastiaan A.
Publié: (2024)

Proof Complexity of Linear Logics
par: Tabatabai, Amirhossein Akbar, et autres
Publié: (2026)

Computing with Infinite Objects: the Gray Code Case
par: Spreen, Dieter, et autres
Publié: (2021)

Localized Attractor Computations for Infinite-State Games (Full Version)
par: Schmuck, Anne-Kathrin, et autres
Publié: (2024)

Speedability of computably approximable reals and their approximations
par: Barmpalias, George, et autres
Publié: (2026)

Verification and External Parameter Inference for Stochastic World Models
par: Calinescu, Radu, et autres
Publié: (2025)

Deciding Equations in the Time Warp Algebra
par: van Gool, Sam, et autres
Publié: (2023)

Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability
par: Orvalho, Pedro, et autres
Publié: (2026)

Colimit-Based Composition of High-Level Computing Devices
par: Arellanes, Damian
Publié: (2026)

Computing Supported Models via Transformation to Stable Models
par: Li, Fang, et autres
Publié: (2025)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
par: Atserias, Albert, et autres
Publié: (2024)

Exponential Sample Complexity Separation between Flat and Hierarchical Agentic Theorem Provers
par: Sonoda, Sho, et autres
Publié: (2026)

Base-extension Semantics for Modal Logic
par: Eckhardt, Timo, et autres
Publié: (2024)

Base-extension Semantics for Intuitionistic Modal Logics
par: Buzoku, Yll, et autres
Publié: (2025)

Concrete Security Bounds for Simulation-Based Proofs of Multi-Party Computation Protocols
par: Sojakova, Kristina, et autres
Publié: (2025)

Enumerating Independent Linear Inferences
par: Das, Anupam, et autres
Publié: (2021)

FSLI: An Interpretable Formal Semantic System for One-Dimensional Ordering Inference
par: Alkhairy, Maha, et autres
Publié: (2025)

Correspondence and Inverse Correspondence for Input/Output Logic and Region-Based Theories of Space
par: De Domenico, Andrea, et autres
Publié: (2024)

From Proof-theoretic Validity to Base-extension Semantics for Intuitionistic Propositional Logic
par: Gheorghiu, Alexander V., et autres
Publié: (2022)

Two-Variable Logic for Hierarchically Partitioned and Ordered Data
par: Fiuk, Oskar, et autres
Publié: (2025)

Terminating Hybrid Tableaus for Ordered Models
par: Nishimura, Yuki
Publié: (2025)

Prime Factorization in Models of PV$_1$
par: Ježil, Ondřej
Publié: (2025)

A Logic of Secrecy on Simplicial Models
par: Wang, Shanxia
Publié: (2026)

Modelling of logical systems by means of their fragments
par: Rybakov, Mikhail
Publié: (2025)

Modelling Multiplicative Linear Logic via Deep Inference
par: Galor, Tomer, et autres
Publié: (2024)

Semantic Properties of Computations Defined by Elementary Inference Systems
par: Lucas, Salvador
Publié: (2025)

The Complexity of HyperQPTL
par: Regaud, Gaëtan, et autres
Publié: (2024)