Sciweavers

135 search results - page 12 / 27
» Constructive Logic with Strong Negation as a Substructural L...
Sort
View
134
Voted
ASP
2003
Springer
15 years 7 months ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
IJCAI
2007
15 years 3 months ago
A New Perspective on Stable Models
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
SCP
2010
155views more  SCP 2010»
15 years 6 days ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
140
Voted
VMCAI
2010
Springer
15 years 8 months ago
Regular Linear Temporal Logic with Past
This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logi...
César Sánchez, Martin Leucker
JMLR
2008
127views more  JMLR 2008»
15 years 1 months ago
Incremental Identification of Qualitative Models of Biological Systems using Inductive Logic Programming
The use of computational models is increasingly expected to play an important role in predicting the behaviour of biological systems. Models are being sought at different scales o...
Ashwin Srinivasan, Ross D. King