Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,237,884 papers from all fields of science
Search
Sign In
Create Free Account
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic (TOCL) is a scientific journal that aims to disseminate the latest findings of note in the field of logic in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Computational logic
Logic in computer science
Symposium on Logic in Computer Science
Vladimir Lifschitz
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Decidability of Downward XPath
Diego Figueira
TOCL
2012
Corpus ID: 322388
We investigate the satisfiability problem for downward-XPath, the fragment of XPath that includes the child and descendant axes…
Expand
2010
2010
Extending OWL with Integrity Constraints
Jiao Tao
,
E. Sirin
,
J. Bao
,
D. McGuinness
Description Logics
2010
Corpus ID: 9621977
Since m1 and m2 are not explicitly defined to be different from each other, they will be inferred to be same due to the…
Expand
2010
2010
Nonuniform Boolean constraint satisfaction problems with cardinality constraint
N. Creignou
,
Henning Schnoor
,
Ilka Schnoor
TOCL
2010
Corpus ID: 15396769
We study the computational complexity of Boolean constraint satisfaction problems with cardinality constraint. A Galois…
Expand
2009
2009
On the complexity of identifying head-elementary-set-free programs
Fabio Fassetti
,
L. Palopoli
Theory and Practice of Logic Programming
2009
Corpus ID: 10069360
Abstract Head-elementary-set-free (HEF) programs were proposed in (Gebser et al. 2007) and shown to generalize over head-cycle…
Expand
2008
2008
A Sound and Complete Algorithm for Simple Conceptual Logic Programs
C. Feier
,
S. Heymans
2008
Corpus ID: 14705579
Open Answer Set Programming (OASP) is a knowledge representation paradigm that allows for a tight integration of Logic…
Expand
2008
2008
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
S. Mitra
,
K. Chandy
International Conference on Theorem Proving in…
2008
Corpus ID: 1974762
Correctness of many hybrid and distributed systems require stability and convergence guarantees. Unlike the standard induction…
Expand
2008
2008
An infinite-game semantics for well-founded negation in logic programming
Chrysida Galanaki
,
P. Rondogiannis
,
W. Wadge
Annals of Pure and Applied Logic
2008
Corpus ID: 1661837
2006
2006
Open answer set programming with guarded programs
S. Heymans
,
Davy Van Nieuwenborgh
,
D. Vermeir
TOCL
2006
Corpus ID: 10058306
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary…
Expand
2006
2006
Names and binding in type theory
Ulrich Schöpp
2006
Corpus ID: 36999994
Names and name-binding are useful concepts in the theory and practice of formal systems. In this thesis we study them in the…
Expand
2001
2001
Editorial: ACM Transactions on computational logic
K. Apt
,
A. Kakas
,
F. Sadri
2001
Corpus ID: 60581411
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE