2062 search results - page 58 / 413 » Derivatives of Logical Formulas |
IJAC
2010
14 years 8 months ago
2010
We give an algebraic characterization of the tree languages that are defined by logical formulas using certain Lindstr
113
click to vote
PLANX
2007
15 years 11 days ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
CADE
2007
Springer
15 years 11 months ago
2007
Springer
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
TIME
1999
IEEE
15 years 3 months ago
1999
IEEE
We present a new forward chaining planner, TALplanner, based on ideas developed by Bacchus [5] and Kabanza [11], where domain-dependent search control knowledge represented as tem...
LPNMR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...