activity
20092024
most citedLogical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation

29 citations · 35 across the 5 of their papers we have counts for

collaborators

5 papers

cs.AI2024

Techniques for Measuring the Inferential Strength of Forgetting Policies

Patrick Doherty, Andrzej Szalas

The technique of forgetting in knowledge representation has been shown to be a powerful and useful knowledge engineering tool with widespread application. Yet, very little research…

cs.AI2023★ 2 cited

Dual Forgetting Operators in the Context of Weakest Sufficient and Strongest Necessary Conditions

Patrick Doherty, Andrzej Szalas

Forgetting is an important concept in knowledge representation and automated reasoning with widespread applications across a number of disciplines. A standard forgetting operator,…

cs.LO2019

A Paraconsistent ASP-like Language with Tractable Model Generation

Andrzej Szalas

Answer Set Programming (ASP) is nowadays a dominant rule-based knowledge representation tool. Though existing ASP variants enjoy efficient implementations, generating an answer set…

cs.LO2010★ 29 cited

Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation

Jan Maluszynski, Andrzej Szalas

The paper discusses properties of a DATALOG-like query language 4QL, originally outlined in [MS10]. Negated literals in heads of rules naturally lead to inconsistencie…

cs.LO2009★ 4 cited

Optimal Tableau Decision Procedures for PDL

Linh Anh Nguyen, Andrzej Szałas

We reformulate Pratt's tableau decision procedure of checking satisfiability of a set of formulas in PDL. Our formulation is simpler and more direct for implementation. Extending t…