Search
Now showing items 1-4 of 4
(Chapter / Bokkapittel / AcceptedVersion; Peer reviewed, 2012)
Node selecting tree automata (NSTAs) constitute a general formalism defining unary queries over trees. Basically, a node is selected by an NSTA when it is visited in a selecting state during an accepting run. We consider ...
(Conference object / Konferansebidrag, 2012)
Over the past decades, a number of calculi for automated reasoning have been proposed that share some core features: 1. proofs are built in a tableau/sequent style as trees where nodes are labeled with literals, and 2. ...
(Journal article / Tidsskriftartikkel / PublishedVersion; Peer reviewed, 2012)
Coherent logic is a syntactically defined fragment of first-order logic. The paper describes an experiment with a prover for coherent logic. A prover here means software that takes as input a theory in coherent logic, and ...
(Journal article / Tidsskriftartikkel / AcceptedVersion; Peer reviewed, 2012)
We study the membership problem for regular expressions extended with operators for unordered concatenation and numerical constraints. The unordered concatenation of a set of regular expressions denotes all sequences ...