analiza aiqbench
This research presents a formal logic framework enabling autonomous systems to make optimal decisions when faced with conflicting norms and uncertain information, reducing the problem to polynomial-time MaxSAT solvers. By distinguishing between subjective optimization based on an agent's beliefs and objective optimization based on actual facts, the work offers a rigorous mathematical foundation for robust AI behavior in complex environments.
A Simple Doxastic Deontic Logic for Norm-Guided Decision Making
arXiv:2610.00668v1 Announce Type: new Abstract: Making decisions despite conflicting norms and incomplete or unreliable information is a fundamental challenge for autonomous systems. We introduce a simple doxastic deontic logic for this setting: a classically reducible fragment of Chellas' Minimal Deontic Logic, extended with explicit conditional norms and combined with multi-agent KD45, so that norms can depend on agents' beliefs about both facts and norms. On this logic we define the Doxastic Norm Compliance Optimization Problem, where an agent chooses a decision minimizing weighted norm violations. We distinguish subjective optimization (relative to the agent's beliefs) from objective optimization (relative to the actual facts). We give conditions under which (i) the two coincide and (ii) optimal decision-making can be reduced to weighted partial MaxSAT in polynomial time.
Abstract:Making decisions despite conflicting norms and incomplete or unreliable information is a fundamental challenge for autonomous systems. We introduce a simple doxastic deontic logic for this setting: a classically reducible fragment of Chellas' Minimal Deontic Logic, extended with explicit conditional norms and combined with multi-agent KD45, so that norms can depend on agents' beliefs about both facts and norms. On this logic we define the Doxastic Norm Compliance Optimization Problem, where an agent chooses a decision minimizing weighted norm violations. We distinguish subjective optimization (relative to the agent's beliefs) from objective optimization (relative to the actual facts). We give conditions under which (i) the two coincide and (ii) optimal decision-making can be reduced to weighted partial MaxSAT in polynomial time.
Manuscript accepted at PRIMA 2026. Includes an additional appendix with proofs
Artificial Intelligence (cs.AI); Logic in Computer Science (cs.LO)
arXiv:2610.00668 [cs.AI]
(or arXiv:2610.00668v1 [cs.AI] for this version)
https://doi.org/10.48550/arXiv.2610.00668 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 230 cuvinte
Subiecte conexe

Hint-based CoT faithfulness evals still mostly work on Claude
LessWrong · 30 iul. 2026
The Continual Constitutional Convention: How language models revise the documents that govern them
AI Alignment Forum · 13 oct. 2026
The J-Space Debate, Agent Swarms, and Pacing Frontier AI - Digital Minds Newsletter #4
LessWrong · 18 sept. 2026

Deconfusing Corrigibility
AI Alignment Forum · 17 oct. 2026