Sciweavers

899 search results - page 14 / 180
» A CTL-Based Logic for Program Abstractions
Sort
View
CORR
2002
Springer
117views Education» more  CORR 2002»
13 years 7 months ago
Computing stable models: worst-case performance estimates
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
Zbigniew Lonc, Miroslaw Truszczynski
FROCOS
2007
Springer
14 years 1 months ago
Idempotent Transductions for Modal Logics
Abstract. We investigate the extension of modal logics by bisimulation quantifiers and present a class of modal logics which is decidable when augmented with bisimulation quanti...
Tim French
KI
2006
Springer
13 years 7 months ago
Agent Logics as Program Logics: Grounding KARO
Abstract. Several options are available to relate agent logics to computational agent systems. Among others, one can try to find useful executable fragments of an agent logic or us...
Koen V. Hindriks, John-Jules Ch. Meyer
AWIC
2005
Springer
14 years 28 days ago
Tuples Extraction from HTML Using Logic Wrappers and Inductive Logic Programming
This paper presents an approach for applying inductive logic programming to information extraction from HTML documents structured as unranked ordered trees. We consider information...
Costin Badica, Amelia Badica, Elvira Popescu
ICALP
2010
Springer
13 years 9 months ago
B and D Are Enough to Make the Halpern-Shoham Logic Undecidable
Abstract. The HalpernShoham logic is a modal logic of time intervals. Some eort has been put in last ten years to classify fragments of this beautiful logic with respect to decid...
Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kie...