On Regular Paths with Counting and Data Tests
Regular path expressions represent the navigation core of the XPath query language for semi-structured data (XML), and it has been characterized as the First Order Logic with Two Variables (FO2). Data tests refers to (dis)equality comparisons on data ...
Kripke-type Semantics for CG3'
In Osorio et al. Revisiting Z. Notre Dame Journal of Formal Logic, 55(1):129-155, 2014 introduced a paraconsistent three-valued logic, the logic CG3' which was named after the logic G3' due to the close relation between them. Authors defined CG3' via ...
The Incremental Satisfiability Problem for a Two Conjunctive Normal Form
We propose a novel method to review Kźź when K and ź are both in Conjunctive Normal Forms (CF). We extend our method to solve the incremental satisfiablity problem (ISAT), and we present different cases where ISAT can be solved in polynomial ...
Computing the Clique-width of Cactus Graphs
Similar to the tree-width (twd), the clique-width (cwd) is an invariant of graphs. A well known relationship between tree-width and clique-width is that cwd(G)ź3ź2twd(G)-1. It is also known that tree-width of Cactus graphs is 2, therefore the clique-...
Defining Stage Argumentation Semantics in Terms of an Abducible Semantics
We define a new logic programming semantics in terms of abducible atoms. We use it to characterize the stage extensions of an argumentation framework AF by means of an associated normal program PAF. We also define the stage semantics for a special type ...
