Parametric Connectives in Disjunctive Logic Programming
Simona Perri, Nicola Leone
Abstract
Disjunctive Logic Programming () is an advanced formalism for Knowledge Representation and Reasoning (KRR). is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class 2 (). Importantly, the encodings are often simple and natural. In this paper, we single out some limitations of for KRR, which cannot naturally express problems where the size of the disjunction is not known ``a priori'' (like N-Coloring), but it is part of the input. To overcome these limitations, we further enhance the knowledge modelling abilities of , by extending this language by Parametric Connectives (OR and AND). These connectives allow us to represent compactly the disjunction/conjunction of a set of atoms having a given property. We formally define the semantics of the new language, named DLP, and we show the usefulness of the new constructs on relevant knowledge-based problems. We address implementation issues and discuss related works.
Create a lesson
Related papers
BEAKER: An Expert-Curated Benchmark for Embodied Brains in Self-Driving Chemical Laboratories
Fei Lin, Tengchao Zhang, Ziyang Gong et al.
FrontierPhysics: Evaluating Agents for End-to-End Physics Research
Bingran You, Wenjun Ke, Ria Rosenauer et al.
Dull, Dirty, Dangerous? Working Conditions and the Limits of Occupational AI Exposure
Siyi Yu
Learning to Decode Linear Codes with Generalized Belief Propagation Network
Samira Malek
On Turn-Level Best-of-N Sampling for Scaling LLM Agents
Jalaj Bhandari, Dhawal Gupta, Hongli Zhan et al.
CompressionBench: How can your coding agents compress LLMs?
Xinrui Zhong, Zhifeng Li, Zhiming Wang et al.