762 citations
- University of Nebraska–LincolnUS20 papers
- Rutgers, The State University of New JerseyUS15 papers
- Hebrew University of JerusalemIL14 papers
- Armagh Observatory & PlanetariumGB9 papers
- University at Buffalo, State University of New YorkUS8 papers
- University of PotsdamDE7 papers
- Indian Institute of Technology KharagpurIN6 papers
- Kennesaw State UniversityUS6 papers
- Chinese Academy of SciencesCN5 papers
- Peking UniversityCN5 papers
- Los Alamos National LaboratoryUS4 papers
- The University of Texas at AustinUS4 papers
153 papers
Bound-Founded Semantics for Answer Set Programming with Difference Constraints: Preliminary Report
Pedro Cabalar, Jorge Fandinno, Nicolas Rühling +3
While the integration of linear constraints has significantly expanded the reach of Answer Set Programming (ASP), existing hybrid solvers often rely on disparate semantic underpinn…
Parametric Modular Answer Set Programs Made Declarative
Jorge Fandinno, Yuliya Lierler, Torsten Schaub
In this paper, we explore the concept of modularity in first-order answer set programming (ASP). We introduce a new formalism called parametric modular logic programs, which allows…
A Novel Quantum Augmented Framework to Improve Microgrid Cybersecurity
Nitin Jha, Prateek Paudel, Abhishek Parakh +1
Small modular nuclear reactors (SMRs) are redefining the energy generation landscape by enabling the deployment of modular, scalable, and pre-built power units that can be used to…
LLM-Enabled Open-Source Systems in the Wild: An Empirical Study of Vulnerabilities in GitHub Security Advisories
Fariha Tanjim Shifat, Hariswar Baburaj, Ce Zhou +2
Large language models (LLMs) are increasingly embedded in open-source software (OSS) ecosystems, creating complex interactions among natural language prompts, probabilistic model o…
Deductive Systems for Logic Programs with Counting
Jorge Fandinno, Vladimir Lifschitz
In answer set programming, two groups of rules are considered strongly equivalent if they have the same meaning in any context. Strong equivalence of two programs can be sometimes…
SM-based Semantics for Answer Set Programs Containing Conditional Literals and Arithmetic
Zachary Hansen, Yuliya Lierler
Modern answer set programming solvers such as CLINGO support advanced language constructs that improve the expressivity and conciseness of logic programs. Conditional literals are…