The evolution of logic programming languages and their integration with ontologies has led to description logic programs, a formalism that combines logical rules with ontological knowledge. In this context, well-supported semantics ensures that no answer set relies on cycles, an essential property for robust artificial intelligence systems. However, current proposals have two key limitations: an increase in computational complexity for the consistency problem, rising to the second level of the polynomial hierarchy, and the lack of a reduct transformation characterization. In this article we present a new semantics for description logic programs that evaluates ontological atoms more strictly, keeping the consistency problem NP-complete, and that admits a characterization via a fixpoint operator and a reduct transformation. This new proposal is a strict subset of the original well-supported semantics, preserving its notion of well-foundedness while introducing a stricter notion similar to that of traditional logic programming.
From a technical perspective, the new semantics redefines the evaluation of ontological atoms. While previous semantics allowed certain interpretations that generated unwanted cycles, the new version imposes stronger conditions that eliminate those cycles without increasing theoretical complexity. This has direct implications for the design of rule-based systems, such as those used in business decision-making, knowledge management, and AI agents. By keeping complexity at NP-complete, it facilitates the implementation of efficient reasoners that can scale with large volumes of ontological data. Moreover, the fixpoint operator characterization allows formal properties to be proved more directly, opening the door to optimizations in inference engines.
Equivalence with the previous semantics for a specific syntactic class —programs where ontological atoms appear in strictly modal positions— ensures that already developed systems do not become obsolete. Developers can migrate gradually without losing functionality in cases that already worked correctly. This compatibility is crucial for enterprise environments where business continuity is a priority.
At Q2BSTUDIO, as a company specialized in software and technology development, we see this advancement as an opportunity to strengthen our artificial intelligence solutions. The new well-supported semantics fits perfectly into the creation of custom applications that require logical reasoning over complex ontologies, for example, in recommendation systems, compliance engines, or explainable virtual assistants. Our team integrates these logical foundations into cloud platforms (AWS/Azure) and cybersecurity solutions, where rule consistency is critical to avoid vulnerabilities arising from circular inferences.
Furthermore, the ability to characterize semantics via a reduct transformation simplifies integration with Business Intelligence (BI) tools like Power BI. By transforming ontological rules into a reduced format, it is possible to feed dashboards with verified logical conclusions, improving the quality of executive reports. For instance, in a fraud detection system, well-founded rules avoid false positives generated by cyclic dependencies among indicators.
The new semantics also empowers the development of autonomous AI agents. These agents, which must operate in dynamic environments with partial information, benefit from a cycle-free knowledge base. The stricter well-founded notion aligns with traditional logic programming semantics, facilitating debugging and behavior verification. At Q2BSTUDIO we have applied similar principles in process automation projects, where business rules are expressed in logical languages and executed on scalable cloud infrastructures.
From a business perspective, adopting this new semantics provides a competitive advantage. Organizations that need ontology-based reasoning systems —such as those in healthcare, finance, or logistics— can reduce computational costs and obtain faster responses without sacrificing logical correctness. NP-complete complexity, though still hard, is manageable with modern solving techniques and allows integrating logical reasoning into custom web and mobile applications.
For those interested in implementing these ideas, at Q2BSTUDIO we offer custom software development services covering everything from ontological logic conception to cloud deployment. Our engineering team combines expertise in logic programming, artificial intelligence, and cybersecurity to build robust and scalable systems. The new well-supported semantics is just one example of how theoretical advances can be translated into practical solutions that make a difference in the market.
In conclusion, the proposal for a stricter well-supported semantics for description logic programs represents a milestone at the intersection of computational logic and applied artificial intelligence. By keeping complexity at NP-complete and providing complete formal characterizations, it paves the way for more efficient and reliable reasoning tools. At Q2BSTUDIO we are committed to technological innovation and applying these foundations to real projects, helping companies harness the full potential of description logic in the age of artificial intelligence.
