Sciweavers

551 search results - page 9 / 111
» {log}: A Logic Programming Language with Finite Sets
Sort
View
FOSSACS
2008
Springer
13 years 9 months ago
Coalgebraic Logic and Synthesis of Mealy Machines
Abstract. We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds t...
Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexan...
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 7 months ago
A Translational Approach to Constraint Answer Set Solving
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ...
Christian Drescher, Toby Walsh
CADE
2006
Springer
14 years 8 months ago
Using the TPTP Language for Writing Derivations and Finite Interpretations
One of the keys to the success of the TPTP and related projects is their consistent use of the TPTP language. The ability of the TPTP language to express solutions as well as probl...
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Al...
ASP
2003
Springer
14 years 1 months ago
Integrating Semantic Web Reasoning and Answer Set Programming
Abstract. We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, feat...
Stijn Heymans, Dirk Vermeir
JELIA
2010
Springer
13 years 6 months ago
Translating First-Order Causal Theories into Answer Set Programming
Abstract. Nonmonotonic causal logic became a basis for the semantics of several expressive action languages. Norman McCain and Paolo Ferraris showed how to embed propositional caus...
Vladimir Lifschitz, Fangkai Yang