Results 1  10
of
23,711
Automata and Answer Set Programming
 In Logical Foundations of Computer Science
, 2009
"... Schlipf (Schlipf 1995) proved that the Stable Logic Programming solves all NP decision problems. We extend Schlipf’s result to all search problems in the class NP. Moreover, we do this in a uniform way as defined in (Marek & Truszczyfiski 1999). Specifically, we show that there is a single DATAL ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Schlipf (Schlipf 1995) proved that the Stable Logic Programming solves all NP decision problems. We extend Schlipf’s result to all search problems in the class NP. Moreover, we do this in a uniform way as defined in (Marek & Truszczyfiski 1999). Specifically, we show that there is a single
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 571 (50 self)
 Add to MetaCart
We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given
Set Automata
 Combinatorics, Complexity and Logic; Proceedings of the DMTCS'96
, 1996
"... In order to characterize certain formal languages capturing some syntactic aspects of higher programming languages we introduce automata with the storage type set, called set automata. We show the corresponding language class to have an NPcomplete membership problem and a decidable emptiness proble ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In order to characterize certain formal languages capturing some syntactic aspects of higher programming languages we introduce automata with the storage type set, called set automata. We show the corresponding language class to have an NPcomplete membership problem and a decidable emptiness
with Automata
"... scenarios that occur in real life, has led to the game achieving a rather celebrated status in the game theory community. Many researchers have tried to find some way to recover cooperation—that is, to find some argument for how and why mutual cooperation can rationally occur in the prisoner’s dilem ..."
Abstract
 Add to MetaCart
scenarios that occur in real life, has led to the game achieving a rather celebrated status in the game theory community. Many researchers have tried to find some way to recover cooperation—that is, to find some argument for how and why mutual cooperation can rationally occur in the prisoner’s dilemma. I introduce two of the more successful such ideas; techniques from computer science feature prominently in both.
Extensions of Answer Set Programming
"... We discuss a number of possible extensions of Answer Set Programming. The four formalisms we investigate are: 1. logic programs where the negative parts of the bodies in clauses can be replaced by arbitrary constraints which we call Arbitrary Constraint Logic Programming (ACLP), 2. logic programs wh ..."
Abstract
 Add to MetaCart
We discuss a number of possible extensions of Answer Set Programming. The four formalisms we investigate are: 1. logic programs where the negative parts of the bodies in clauses can be replaced by arbitrary constraints which we call Arbitrary Constraint Logic Programming (ACLP), 2. logic programs
Temporal Answer Set Programming ∗
"... Answer Set Programming (ASP) has become a popular way for representing different kinds of scenarios from knowledge representation in Artificial Intelligence. Frequently, these scenarios involve a temporal component which must be considered. In ASP, time is usually represented as a variable whose val ..."
Abstract
 Add to MetaCart
Answer Set Programming (ASP) has become a popular way for representing different kinds of scenarios from knowledge representation in Artificial Intelligence. Frequently, these scenarios involve a temporal component which must be considered. In ASP, time is usually represented as a variable whose
Answering XML Twig Queries with Automata
, 2004
"... XML is emerging as a de facto standard for information representation and data exchange over the web. Evaluation of twig queries, which allows users to find all occurrence of a multiple branch pattern in an XML database, is a core and complicate operation for XML query processing. Performance of ..."
Abstract
 Add to MetaCart
XML is emerging as a de facto standard for information representation and data exchange over the web. Evaluation of twig queries, which allows users to find all occurrence of a multiple branch pattern in an XML database, is a core and complicate operation for XML query processing. Performance of conventional evaluation approaches based on structural join declines with the expansion of data size and query complexity.
Open answer set programming with guarded programs
, 2006
"... Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a fixed point logic (FPL) extension of Clark’s completion such that open answer sets correspond to models of FPL formulas and i ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a fixed point logic (FPL) extension of Clark’s completion such that open answer sets correspond to models of FPL formulas
Dynamical Properties of Answer Set Programs
, 2001
"... Howard A. Blair EECS Dept., 2177 SciTech Syracuse University Syracuse, NY 13210 USA ..."
Abstract
 Add to MetaCart
Howard A. Blair EECS Dept., 2177 SciTech Syracuse University Syracuse, NY 13210 USA
Results 1  10
of
23,711