About
Objective
Purpose
Concepts
Philosophy
ILA
GCI
What Next?
Matrix
Terms
Privacy
Aspects
Facets
Research
Programming
Design
Professions
Scientist
Developer
Artist
Achievements
Ranks
Grades
Titles
Content
Data/Entries/Relations
Blog/Posts/Comments
Wiki/Pages/Tags
Articles (Reports/Reviews)
Ontology
Tutorials
Links
Media
Polls
Questionnaires
Repository
Annotations
Classifications
Tissues
Species
Interactions
Expressions
Profiles
Signatures
Intersections
Sets
Meta
Datasets
Create
References
Archive
Changes
Lifespan
Studies
Experiments
Measurements
Comparisons
Interventions
Factors
Variants
Assays
Strains
Regimens
Manipulations
Epistases
Experts
Profiles
Collaborations
Com
Messaging
Announcements
Video
Donate
Log in
or
Sign up
Denigma
>
Wiki
> Page = Resolution > Edit
o
Start
|
Search
|
Index
Mouse Lifespan Experiments
(
Hide
)
Wiki
Resolution - Editing
leave this field blank to prove your humanity
Query Q If we want to know whether K => Q i.e. not K or Q is True i.e. K and not Q is False In other words K augmented with ``not Q`` entails falsehood, for sure. Resolution procidor may bot actual finish. Resolution may never end; never (whatever algorithm): undecidability Other resolution may take an huge time to be solved: intractability. Propositional logic is decidbale, but intractable (SAT, NP ..). Automates reasoning, semantic-web. OWL-DL, OWL-lite (description logic: leader sets person ...) deci Statements about the structure of the world are not undecibebality but may intractability, Horn logic is essential rules, like a person if there is only one conclusions on the right statement. Such statements are undecidable (except with caveats); but always tractable.
Tags:
